Conflict-Free Flight Scheduling Using Strategic Demand Capacity Balancing for Urban Air Mobility Operations
By: Vahid Hemmati , Yonas Ayalew , Ahmad Mohammadi and more
Potential Business Impact:
Keeps flying cars from crashing into each other.
In this paper, we propose a conflict-free multi- agent flight scheduling that ensures robust separation in con- strained airspace for Urban Air Mobility (UAM) operations application. First, we introduce Pairwise Conflict Avoidance (PCA) based on delayed departures, leveraging kinematic principles to maintain safe distances. Next, we expand PCA to multi-agent scenarios, formulating an optimization approach that systematically determines departure times under increasing traffic densities. Performance metrics, such as average delay, assess the effectiveness of our solution. Through numerical simulations across diverse multi-agent environments and real- world UAM use cases, our method demonstrates a significant reduction in total delay while ensuring collision-free operations. This approach provides a scalable framework for emerging urban air mobility systems.
Similar Papers
Fair-CoPlan: Negotiated Flight Planning with Fair Deconfliction for Urban Air Mobility
Robotics
Makes flying taxis share sky fairly.
From Patchwork to Network: A Comprehensive Framework for Demand Analysis and Fleet Optimization of Urban Air Mobility
Distributed, Parallel, and Cluster Computing
Flies people faster in cities using airports.
AGCo-MATA: Air-Ground Collaborative Multi-Agent Task Allocation in Mobile Crowdsensing
Multiagent Systems
Drones and robots work together to finish jobs faster.