Separation Assurance in Urban Air Mobility Systems using Shared Scheduling Protocols

Surya Murthy, Tyler Ingebrand, Sophia Smith, Ufuk Topcu, Peng Wei, Natasha A. NeogiarXiv 2025 · OpenReview

TL;DR

This paper proposes a novel tactical separation approach for Urban Air Mobility (UAM) systems by adapting shared scheduling protocols, commonly used in computer networks, to manage aircraft traffic at intersection bottlenecks. The method uses a decentralized framework to allow aircraft to autonomously coordinate their speed and timing, effectively eliminating separation violations in simulated scenarios while introducing only a bounded increase in flight times.

What Problem Does This Paper Address?

Ensuring safe separation between aircraft is paramount in air traffic management, especially in the burgeoning Urban Air Mobility (UAM) domain. UAM environments are characterized by high traffic density and low altitudes, creating a critical need for precise control. A significant challenge arises at the intersections of flight corridors, where multiple aircraft are likely to converge, increasing the risk of conflicts and potential separation violations. Traditional air traffic management relies on human controllers, which is not scalable for the anticipated density of UAM operations. Existing autonomous solutions often require extensive training or centralized control, which can be impractical. This paper addresses the need for a decentralized, real-time tactical separation approach that can effectively manage conflicts at these critical intersection points.

Methods

The core of this paper's approach is the adaptation of shared scheduling protocols for UAM traffic management. These protocols, originally designed for resource sharing in computer systems, are used here to coordinate aircraft access to bottlenecks, which are defined as intersections of flight corridors. The system is modeled as a decentralized Markov Decision Process (dec-MDP), where each aircraft acts as an agent with local observations.

The key innovation lies in applying these protocols to ensure aircraft autonomously adjust their speed and timing to avoid conflicts at intersections. Three specific protocols are evaluated:

  • Carrier-Sense Multiple Access with Collision Detection (CSMA/CD): A decentralized protocol where aircraft sense the "air" for traffic and wait if another aircraft is using the intersection. If a conflict arises, a random waiting time is introduced.
  • Shortest Remaining Time First (SRTF): Also decentralized, this protocol prioritizes aircraft that are closest to exiting the intersection, assuming they have the shortest remaining time to clear the bottleneck.
  • Round Robin: This is a centralized protocol where a central authority assigns priority to specific flight corridors, allowing aircraft on that corridor to pass freely while others wait.

The protocols leverage aircraft's ability to halt and hover (using an ahalt action) to enforce "wait" commands, which is crucial for their effectiveness.

Datasets

The paper does not mention the use of pre-existing datasets for training or evaluation. Instead, they utilize a custom simulation scenario within the BlueSky Air Traffic Simulator [31]. This simulator is described as an open-source platform that allows for flexible scenario creation. The simulation setting consists of 6 routes and 2 intersections, with varying traffic densities to assess the protocols' performance.

Key Insights and Ideas

  • Leveraging Computer Networking Concepts for Aviation: The paper demonstrates the surprising effectiveness of adapting established computer networking protocols (like CSMA/CD) to solve complex aviation safety problems. This highlights a potential cross-disciplinary approach for future research.
  • Decentralized Control for Scalability: The reliance on decentralized protocols means that aircraft can make decisions based on local observations, avoiding the need for a central air traffic controller, which is crucial for the scalability of UAM systems.
  • Bottlenecks as Critical Conflict Points: The formalization of intersections as "bottlenecks" and the focus on coordinating access to these specific areas is a key conceptual contribution.
  • The "Wait" Command is Crucial: The ability for aircraft to halt and hover is identified as a critical enabler for shared scheduling protocols, allowing them to effectively enforce "wait" commands.
  • Trade-off Between Safety and Efficiency: While the protocols achieve zero separation violations, they do introduce an increase in flight times, particularly at higher traffic densities. This highlights a fundamental trade-off that needs to be managed.
  • Vulnerability to Non-Compliance: The research clearly shows that the effectiveness of these protocols is highly dependent on aircraft adherence. Non-compliant aircraft can compromise the guaranteed safety, though the protocols still offer significant improvement over a baseline with no scheduling.

Key Results

  • Zero Separation Violations: In simulated scenarios with compliant aircraft, all tested shared scheduling protocols (CSMA/CD, SRTF, and Round Robin) successfully reduced Loss of Separation (LOS) events to zero, even with increasing traffic densities.
  • Bounded Increase in Flight Times: While safety is achieved, flight times increase. CSMA/CD and SRTF showed a maximum 15% increase in flight times, while Round Robin saw a 60% increase at the highest traffic density (25 aircraft per route).
  • Halting Times Vary by Protocol: SRTF generally had the shortest halting times, followed by CSMA/CD, and then Round Robin, which experienced the longest halting times due to its turn-based nature. Halting times increased with traffic density for all protocols.
  • Performance with Non-Compliant Aircraft: When non-compliant aircraft were introduced, the protocols could no longer guarantee zero LOS events. However, they still provided significant improvements over a baseline with no scheduling. CSMA/CD showed the best performance in settings with high percentages of non-compliant aircraft.

Limitations and Future Work

  • Halting Times: A significant limitation identified is the increase in halting times at intersections, especially with higher traffic densities.
  • Non-Compliant Aircraft: The protocols' inability to guarantee safety in the presence of non-compliant aircraft is a key limitation.
  • Future Work Suggestions:
    • Strategic Separation Integration: Combining shared scheduling protocols with strategic separation approaches like demand-capacity balancing to reduce traffic density and thus halting times.
  • Reinforcement Learning for Optimization: Integrating shared scheduling with reinforcement learning to optimize halting times by enabling aircraft to reduce speed before reaching intersection boundaries.
  • Accounting for Uncertainty: Developing protocols that can handle uncertainty in aircraft observations to improve robustness in dynamic environments.
  • Exploring Other Protocols: Investigating other scheduling protocols or hybrid approaches.

Summary updated

Abstract

Ensuring safe separation between aircraft is a critical challenge in air traffic management, particularly in urban air mobility (UAM) environments where high traffic density and low altitudes require precise control. In these environments, conflicts often arise at the intersections of flight corridors, posing significant risks. We propose a tactical separation approach leveraging shared scheduling protocols, originally designed for Ethernet networks and operating systems, to coordinate access to these intersections. Using a decentralized Markov decision process framework, the proposed approach enables aircraft to autonomously adjust their speed and timing as they navigate these critical areas, maintaining safe separation without a central controller. We evaluate the effectiveness of this approach in simulated UAM scenarios, demonstrating its ability to reduce separation violations to zero while acknowledging trade-offs in flight times as traffic density increases. Additionally, we explore the impact of non-compliant aircraft, showing that while shared scheduling protocols can no longer guarantee safe separation, they still provide significant improvements over systems without scheduling protocols.
BibTeX
@misc{murthy2025separation,
  author = {Surya Murthy and Tyler Ingebrand and Sophia Smith and Ufuk Topcu and Peng Wei and Natasha A. Neogi},
  title = {{Separation Assurance in Urban Air Mobility Systems using Shared Scheduling Protocols}},
  year = {2025},
  eprint = {2501.08933},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2501.08933},
}
Figure