Primal-dual quadratic programming approach to multiple conflict resolution

Jae Hyuk Oh, Eric Feron

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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 languageEnglish (US)
Title of host publicationProceedings of the American Control Conference
Number of pages5
StatePublished - Dec 1 1998
Externally publishedYes

Bibliographical note

Generated from Scopus record by KAUST IRTS on 2021-02-18


Dive into the research topics of 'Primal-dual quadratic programming approach to multiple conflict resolution'. Together they form a unique fingerprint.

Cite this