This paper considers a multiple conflict resolution problem for air traffic control systems. The time required to optimally solve aircraft conflicts is known to grow exponentially with the number of aircraft involved and may become prohibitive when large numbers of aircraft are involved. As an attempt to circumvent this issue, a heuristic polynomial-time conflict resolution algorithm is proposed on the basis of analysis results on the relationship between primal and dual quadratic programs. © 1998 AACC.
|Original language||English (US)|
|Title of host publication||Proceedings of the American Control Conference|
|Number of pages||5|
|State||Published - Dec 1 1998|