Abstract
This paper considers the problem of resolving conflicts involving multiple aircraft. First a framework is formulated where conflicts may be solved efficiently. Within this framework, the conflict resolution problem is shown to be a non-convex, quadratically constrained quadratic program. Cheap lower bounds to this problem are developed based on positive semidefinite relaxations of the dual of this program. A unique method is proposed to systematically determine the regions of the state-space where the conflict resolution algorithm is guaranteed to perform well within the proposed framework.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings of the IEEE Conference on Decision and Control |
| Publisher | IEEEPiscataway, NJ, United States |
| Pages | 4179-4185 |
| Number of pages | 7 |
| State | Published - Dec 1 1997 |
| Externally published | Yes |