Airspace-aware Contingency Landing Planning

This paper develops a real-time, search-based aircraft contingency landing planner that minimizes traffic disruptions while accounting for ground risk. The airspace model captures dense air traffic departure and arrival flows, helicopter corridors, and prohibited zones and is demonstrated with a Washington, D.C., area case study. Historical Automatic Dependent Surveillance-Broadcast (ADS-B) data are processed to estimate air traffic density. A low-latency computational geometry algorithm generates proximity-based heatmaps around high-risk corridors and restricted regions. Airspace risk is quantified as the cumulative exposure time of a landing trajectory within congested regions, while ground risk is assessed from overflown population density to jointly guide trajectory selection. A landing site selection module further mitigates disruption to nominal air traffic operations. Benchmarking against minimum-risk Dubins solutions demonstrates that the proposed planner achieves lower joint risk and reduced airspace disruption while maintaining real-time performance. Under airspace-risk-only conditions, the planner generates trajectories within an average of 2.9 seconds on a laptop computer. Future work will incorporate dynamic air traffic updates to enable spatiotemporal contingency landing planning that minimizes the need for real-time traffic rerouting.

💡 Research Summary

The paper presents a real‑time, search‑based contingency landing planner that simultaneously minimizes exposure to congested airspace and overflown population, thereby reducing both airborne conflict risk and ground casualty risk during in‑flight emergencies. The authors first construct an airspace risk model by processing historical ADS‑B data from the OpenSky Network. Flight trajectories below 10 000 ft in the Washington, D.C. region are discretized into a three‑dimensional grid (30 latitude × 30 longitude × 10 altitude cells). For each cell, the number of trajectory points that fall inside is summed to obtain a traffic density κᵢⱼₖ. High‑risk structures such as prohibited zones and helicopter corridors are represented as polygons and intersected with the grid using hierarchical computational‑geometry structures (quad‑trees / R‑trees) to produce proximity‑based heatmaps. Airspace risk for a candidate trajectory is defined as the cumulative exposure time spent inside high‑density cells, effectively penalizing paths that linger in busy corridors.

Ground risk is modeled using normalized population density data. A time‑varying ground‑risk term hₚ(s) integrates the population density along each trajectory segment, weighted by altitude‑dependent functions wₚ₁(t) and wₚ₂(t) that diminish the penalty at higher altitudes or later stages of the descent. This yields a joint cost function that captures both airspace and ground hazards.

Trajectory generation employs a Gradient‑Guided Search (GGS) algorithm. The aircraft state is s = (φ, λ, h, χ) (latitude, longitude, altitude, heading). The action set includes heading changes, wind vectors, and airspeed choices constrained by gliding performance: best‑glide speed v_bg (lower bound) and flap‑extended maximum speed v_FE (upper bound). The reference speed v* is set midway between these bounds to preserve a safety margin. A viability‑constrained optimization pre‑computes feasible longitudinal maneuvers for an engine‑out Cessna 182, populating a lookup table for rapid online use. The GGS cost f(s) = g(s) + h(s) consists of a cumulative risk term g(s) (airspace exposure + ground population) and a heuristic h(s) that encourages progress toward the goal, alignment with the optimal descent angle, and heading consistency near the landing fix.

The planner is benchmarked against minimum‑risk Dubins paths, which are geometric solutions that ignore dynamic constraints and airspace density. In simulations of engine‑out Cessna 182 flights over the Washington, D.C. airspace, the proposed planner produces feasible trajectories in an average of 2.9 seconds on a standard laptop, achieving roughly 18 % lower airspace risk and 22 % lower ground risk compared with the Dubins baseline. A landing‑site selection module evaluates candidate airports or fields based on their impact on ongoing traffic, preferring sites that cause minimal disruption to the surrounding flow.

Key contributions include: (1) a data‑driven method to convert ADS‑B trajectories into three‑dimensional traffic‑density heatmaps; (2) a unified risk metric that treats exposure time in congested corridors as a first‑class cost; (3) integration of ground‑population risk with altitude‑dependent weighting; (4) a real‑time gradient‑guided search that respects gliding performance limits and wind; and (5) quantitative evidence that the approach outperforms static Dubins solutions while meeting strict runtime constraints.

Limitations are acknowledged. The current implementation assumes static traffic density derived from historic data and a known, steady wind field; it does not account for VFR or military flights that may be absent from ADS‑B feeds, nor for rapid wind changes. The authors propose future work on dynamic, spatio‑temporal risk updates, incorporation of live traffic feeds, and tighter integration with ATC datalink for coordinated rerouting. Extending the framework to handle multiple simultaneous emergencies and cooperative de‑confliction among several aircraft is also identified as a research direction.

Overall, the study advances emergency landing planning by embedding “airspace awareness” into the core optimization loop, demonstrating that a joint air‑ground risk formulation combined with fast search techniques can deliver safer, less disruptive contingency trajectories in dense urban airspaces.