Multi-Agent Path Finding in Unmanned Aircraft System Traffic Management With Scheduling and Speed Variation

The development of an unmanned aircraft system (UAS) traffic management (UTM) system for the safe integration of unmanned aerial vehicles (UAVs) requires pre-flight conflict detection and resolution (CDR methods to provide collision-free flight paths for all UAVs before takeoff. A popular solution consists in adapting multi-agent path finding (MAPF) techniques. However, standard MAPF solvers consider only a fixed takeoff time and fixed uniform speed for each UAV flight path, which can lead to inefficiencies in the resolution of instances. Therefore, in this article, we propose incorporating scheduling elements into MAPF solvers, which allows us to adjust the takeoff times and speeds of each UAV to solve conflicts. We introduce two time-related resolution techniques: I) takeoff scheduling, whereby - the start time of a UAV agent is delayed, and 2) speed adjustment, wherein the speed of a UAV agent is decreased over a segment on its flight path. Importantly, we present a distinction of conflict types, which enables us to combine replanning resolution to the aforementioned temporal resolution techniques. We evaluate our proposed approaches on a realistic, high-density UAV delivery scenario in Tokyo, Japan. We show that the combination of takeoff scheduling, replanning, and speed-adjust meat resolution techniques improves the efficiency of route planning by reducing the average delay per flight path and the number of rejected flight paths.