This paper considers the conflict resolution problem arising from a large number of aircraft traversing a shared airspace. Aircraft are issued lateral and longitudinal shifts commands over their trajectory to resolve potential conflicts. Lateral and longitudinal shifts given to each aircraft can be abstracted to represent the heading and speed changes over the trajectories. Through this formulation, the resulting conflict resolution algorithm can be formulated as a mixed-integer linear program solvable in real-time. In this model, the procedure aims to assign to each aircraft a sequence of maneuvers instead of a single one. This new method is based on a centralized algorithm with the goal of minimizing the total number of maneuvers issued by the controller while regularizing the trajectories. Copyright © 2010 by the American Institute of Aeronautics and Astronautics, Inc.
|Original language||English (US)|
|Title of host publication||AIAA Infotech at Aerospace 2010|
|State||Published - Dec 16 2010|