Abstract
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. © 2001 The American Institute of Aeronautics and Astronautics, Inc. All rights reserved.
| Original language | English (US) |
|---|---|
| Title of host publication | AIAA Guidance, Navigation, and Control Conference and Exhibit |
| State | Published - Dec 1 2001 |
| Externally published | Yes |