Papers
Topics
Authors
Recent
2000 character limit reached

Dynamic Maneuvering Cue (DMC)

Updated 16 December 2025
  • Dynamic Maneuvering Cue (DMC) is a closed-form metric that quantifies the minimal heading change required for a vehicle to evade adversarial threat zones.
  • It leverages current geometry and kinematics to compute safe boundaries in real-time, facilitating both lightweight feedback and MPC-based controllers.
  • DMC's integration into vehicle control systems offers a balance between rapid goal achievement and robust collision avoidance in dynamic environments.

Dynamic Maneuvering Cue (DMC) is a state-dependent, closed-form metric quantifying the instantaneous heading change required by a controlled vehicle (“Agent”) to guarantee it lies outside the Basic Engagement Zone (BEZ) of one or more adversarial “Threat” vehicles. DMC directly captures the minimum evasive maneuver necessary, given current geometry and kinematics, and serves as a conservative risk metric for capture or collision in dynamic threat regions. Its analytic computability and suitability for real-time, onboard application enable feedback-based guidance and constraint enforcement for both lightweight and optimization-based vehicle controllers (Moll et al., 9 Dec 2025).

1. Mathematical Formulation and Definition

Let the Agent A=(xA,yA)R2A = (x_A, y_A) \in \mathbb{R}^2 travel at constant speed vAv_A with heading θ(π,π]\theta \in (-\pi, \pi], and let a single Threat T=(xT,yT)T = (x_T, y_T) travel at speed vT>vAv_T > v_A. Define the speed ratio pvA/vT(0,1)p \equiv v_A/v_T \in (0,1), a reaction time trt_r, the Threat’s maximum reach R=vTtrR = v_T t_r, and safety radius rr around TT. The BEZ consists of AA-positions from which TT, on optimal interception, can reach within rr of AA in time trt_r, corresponding to a circle of radius R+rR + r centered at

B=TpR[cosψ;sinψ],B = T - p\,R\, [\cos\psi;\, \sin\psi],

where ψ=atan2(yAyT,xAxT)\psi = \operatorname{atan2}(y_A - y_T, x_A - x_T) is the LOS angle from TT to AA.

Given the Agent's current range d=ATd = \|A - T\| and aspect angle ψerr=θψ\psi_{err} = \theta - \psi, the DMC is defined as the minimum signed heading change needed so that, moving at velocity vAv_A along the new heading, AA lies on or outside the BEZ boundary and never enters it (assuming instantaneous turn and constant speed). Specifically,

ϕ=arccos(d2+p2R2(R+r)22pRd),\phi^* = \arccos\left(\frac{d^2 + p^2R^2 - (R + r)^2}{2\,p\,R\,d}\right),

DMC(θ,d)={0θψϕ sign(θψ)min{θψϕ,θψ+ϕ}θψ<ϕ\mathrm{DMC}(\theta, d) = \begin{cases} 0 & |\theta - \psi| \geq \phi^* \ \operatorname{sign}(\theta - \psi) \min\{|\theta - \psi - \phi^*|, |\theta - \psi + \phi^*|\} & |\theta - \psi| < \phi^* \end{cases}

A DMC of zero indicates a safe (non-threatening) configuration; higher values denote increased immediate risk (Moll et al., 9 Dec 2025).

2. Extension to Multiple Simultaneous Threats

With NN threats TiT_i, each parameterized by pi,Ri,rip_i, R_i, r_i, and LOS angle ψi\psi_i, the unsafe region defined by each threat is the cone [ψiϕi,ψi+ϕi][\psi_i - \phi^*_i, \psi_i + \phi^*_i]. The set of headings safe with respect to all threats is

C=i=1NCi,C = \bigcap_{i=1}^N C_i,

where CiC_i is the complement of the unsafe band for threat ii. The aggregate DMC is the smallest heading correction required to project the current heading θ\theta onto the nearest boundary of the (possibly nonconvex) safe set CC. Computationally, this requires O(N)O(N) comparisons, yielding only linear scaling in the number of dynamic threats (Moll et al., 9 Dec 2025).

3. Integration of DMC into Vehicle Controllers

DMC constraints can be incorporated into two primary control architectures:

  • Simple Feedback (Aim-at-Goal with DMC Limiting): A nominal heading θnom=atan2(yGyA,xGxA)\theta_{nom} = \operatorname{atan2}(y_G - y_A, x_G - x_A) is selected, with a DMC-threshold ε0\varepsilon \geq 0 enforced:

θs={θnomDMC(θnom,d)ε θnom+DMC(θnom,d)sign(DMC)εotherwise\theta_s = \begin{cases} \theta_{nom} & |\mathrm{DMC}(\theta_{nom}, d)| \leq \varepsilon \ \theta_{nom} + \mathrm{DMC}(\theta_{nom}, d) - \operatorname{sign}(\mathrm{DMC})\,\varepsilon & \text{otherwise} \end{cases}

If the nominal heading violates the threshold, it is clamped to the boundary of the safe set via a minimal correction. This approach requires only a handful of trigonometric and min–max operations per cycle, suitable for real-time, onboard control.

min{θ0θH}xHG2 subject to    xk+1=f(xk,θk),DMC(θk,dk)ε,k=0H\begin{aligned} &\min_{\{\theta_0 \dots \theta_H\}} \|x_H - G\|^2 \ &\text{subject to}\;\; x_{k+1} = f(x_k, \theta_k),\quad |\mathrm{DMC}(\theta_k, d_k)| \leq \varepsilon, \quad k=0\dots H \end{aligned}

f()f(\cdot) specifies kinematic updates. Decision variables are the future headings; the cost function favors rapid arrival at the goal without DMC violation. Solvers such as SQP or Interior–Point methods enable online solution, with computational cost scaling with planning horizon HH (Moll et al., 9 Dec 2025).

4. Performance Comparison and Computational Characteristics

Empirical evaluation demonstrates key performance trade-offs:

  • In a single-threat scenario (vA=1v_A=1, p=0.9p=0.9, r=0.2r=0.2, R=0.8R=0.8), simple feedback reaches the goal in $6.62$ s, while the numerically optimal trajectory achieves $6.54$ s, a 1.2%1.2\% improvement.
  • In dual-threat cases (ε>0\varepsilon>0), the simple controller may exhibit suboptimal winding direction or oscillations at DMC switching surfaces, while MPC (with H=25H=25, ts=0.07t_s=0.07 s) globally optimizes and shortens paths by up to 10%10\%.

Computationally, simple feedback incurs sub-millisecond per-update cost (“zero-planning”), whereas MPC requires solving nonlinear programs with O(102)O(10^2) variables per cycle (tens to hundreds of ms per update) (Moll et al., 9 Dec 2025).

5. Assumptions and Key Limitations

The DMC methodology, as currently formulated, relies on the following primary assumptions:

  • Agent kinematics are restricted to constant-speed, planar motion with instantaneous heading changes (no explicit turn-rate or acceleration bounds).
  • Threats are assumed adversarial and possess instantaneous arbitrary heading change—this yields conservative capture zones; extensions to non-adversarial or stochastic elements would be less conservative.
  • Engagement is purely two-dimensional; no explicit vertical maneuvering or high-fidelity dynamic constraints are modeled (Moll et al., 9 Dec 2025).

6. Directions for Extension and Application

A range of extensions to the DMC framework are identified as promising:

  • Incorporation of Agent turn rate and acceleration bounds into the analytical DMC construction.
  • Allowing for speed change maneuvers (e.g., climb or acceleration) within the risk cue framework.
  • Integration of DMC with Control Barrier Functions to formally guarantee safety.
  • Robust or stochastic variants of DMC to address threat motion uncertainty.

DMC’s analytical real-time computability and extensibility position it as a fundamental component in next-generation reactive guidance, especially for deconfliction and collision avoidance in adversarial and dynamic environments (Moll et al., 9 Dec 2025).

Definition Search Book Streamline Icon: https://streamlinehq.com
References (1)

Whiteboard

Follow Topic

Get notified by email when new papers are published related to Dynamic Maneuvering Cue (DMC).