Speed-Based Tactical Deconfliction of Multiple Aircraft Around a Vertiport Through a Conservative Airspace Discretization Algorithm and Constraint Programming

This article discusses a novel aircraft coordination algorithm for automated vertiport operation. New applications of Innovative Air Mobility (IAM) including inspection, logistics and security UAVs, Urban Air Mobility (UAM) or Regional Air Mobility (RAM) present a coordination challenge, especially near vertiports, as large numbers of vehicles with different characteristics share the airspace, and so avoiding collisions, optimizing resource usage and operating with low human intervention is important.In this paper, this problem is addressed by proposing a new formulation of the aircraft coordination problem that makes use of a discretized airspace to detect potential conflicts and collisions between cooperative and non-cooperative aircraft in the surroundings of a vertiport. The proposed algorithm not only considers the cells traversed by the aircraft, but also the set of adjacent cells, making the algorithm more conservative and robust than other algorithms found in the literature, and achieving a 100% conflict-detection rate. A mathematical model of aircraft dynamics is employed to turn high-level flight plans into detailed aircraft trajectories, using those trajectories to detect potential collisions. The deconfliction problem is formulated as a mixed-integer optimization program that computes orders of pass for every conflict while minimizing the divergence between requested time of arrival (RTA) and estimated time of arrival (ETA). This problem is implemented in OR-Tools to be solved by means of the CP-SAT solver. The validity of the solution is tested by extensive simulation, showing tactical coordination of up to 25 aircraft landing on a vertiport.