Landing Algorithms in Autonomous Systems

Updated 25 May 2026

Landing algorithms are a collection of methods that integrate trajectory generation, constraint satisfaction, motion planning under uncertainty, and advanced feedback control for precise landings.
They employ constrained optimal control and trajectory planning to optimize factors like safety, fuel efficiency, and environmental impact during the landing phase.
Recent advancements include reinforcement learning, modular optimization, hybrid vision-language reasoning, and Riemannian optimization, enhancing operational robustness.

Landing algorithms constitute a diverse class of decision, control, optimization, and perception-planning techniques for guiding autonomous vehicles—ranging from aircraft, rotorcraft, reusable launch vehicles, drones, ground robots, and planetary landers—through the approach, descent, and touchdown (or docking) phases onto designated or dynamically determined landing sites. Depending on the operational environment (airports, unstructured terrain, moving platforms, dynamic obstacles), physical platform (fixed/rotary wing, spacecraft, legged robot), and real-time constraints (safety, fuel efficiency, environmental cost), landing algorithms integrate trajectory generation, constraint satisfaction, motion planning under uncertainty, and advanced feedback/control architectures. Recent developments include end-to-end reinforcement learning, modular optimization-driven methods, hybrid vision-language reasoning with learned safety margins, and Riemannian optimization techniques for constrained matrix manifolds.

1. Mathematical Formulations and Problem Classes

Landing problems are generally formulated as constrained optimal control or trajectory planning tasks. In air traffic management, the Aircraft Landing Problem (ALP) is commonly defined over a discrete set of $N$ planes, each requiring assignment of a landing time $ST_i$ within allowable time windows $[E_i,L_i]$ , penalty rates for earliness/tardiness $(g_i, h_i)$ , and safety separation constraints $s_{ij}$ , often with multiple runways. The canonical objective is minimization of the total weighted penalty: $\min_{ST} Z = \sum_{i=1}^{N} \left[ g_i \max\{0,T_i-ST_i\} + h_i \max\{0,ST_i-T_i\} \right]$ subject to

$E_i \leq ST_i \leq L_i , \quad ST_{i-1} + s_{i-1,i} \leq ST_i$

for single-runway, fixed-sequence cases (Awasthi et al., 2013).

In dynamic quadrotor landing, the optimal control problem is set over full nonlinear dynamics, with state $x(t)$ and control $u(t)$ , terminal and free-final-time constraints, and performance indices penalizing control effort and landing accuracy. Pontryagin’s Minimum Principle is commonly invoked, yielding a two-point boundary value problem (TPBVP) (Zang et al., 2022).