This paper considers the problem of solving conflicts arising among several aircraft that are assumed to move in a shared airspace. Aircraft can not get closer to each other than a given safety distance in order to avoid possible conflicts between different airplanes. For such system of multiple aircraft, we consider the path planning problem among given waypoints avoiding all possible conflicts. In particular we are interested in optimal paths, i.e. we want to minimize the total flight time. We propose two different formulations of the multi-aircraft conflict avoidance problem as a mixed-integer linear program: in the first case only velocity changes are admissible maneuvers, in the second one only heading angle changes are allowed. Due to the linear formulation of the two problems, solutions may be obtained quickly with standard optimization software, allowing our approach to be implemented in real time.

VL - 3 ER - TY - CONF T1 - Mixed Integer Programming for Aircraft Conflict Resolution T2 - AIAA Guidance, Navigation and Control Conference and Exhibit Y1 - 2001 A1 - L. Pallottino A1 - E. Feron A1 - A. Bicchi KW - Air Traffic Management Systems KW - Autonomous Vehicles KW - Navigation and Planning AB -This paper considers the problem of solving conflicts between several aircraft. Considering the case when only aircraft heading changes are allowed, we propose a formulation of the multi-aircraft conflict avoidance problem as a mixed-integer linear program, whose solution may be obtained within seconds with standard optimization software. While such a problem formulation and solution is still unsuitable for operational implementation, it may be used as part of a real or fast-time simulation.

JF - AIAA Guidance, Navigation and Control Conference and Exhibit ER -