The efficiency of the current centralized air-traffic management is limited. A next-generation air transportation system should allow airplanes (manned and unmanned) to change their flight paths during the flight without approval from a centralized en route control. Such a scheme requires decentralized peer-to-peer conflict detection and collision-avoidance processes. In this paper, two cooperative (negotiation-based) conflict-resolution algorithms are presented: iterative peer-to-peer and multiparty algorithms. They are based on high-level flight-plan variations using evasion maneuvers. The algorithms work with a different level of coordination autonomy, respect realistic assumptions of imprecise flight execution (integrating required navigation performance), and work in real time, where the planning and plan-execution phases interleave. Both algorithms provide a resolution in a 4-D domain (3-D space and time). The proposed algorithms are evaluated experimentally, and their quality is studied in comparison with a state-of-the-art agent-based method-the satisficing game theory algorithm.
['David Šišlák', 'Přemysl Volf', 'Michal Pechoucek']
Agent-Based Cooperative Decentralized Airplane-Collision Avoidance