DocumentCode
325332
Title
Primal-dual quadratic programming approach to multiple conflict resolution
Author
Oh, Jae-Hyuk ; Feron, Eric
Author_Institution
MIT, Cambridge, MA, USA
Volume
5
fYear
1998
fDate
21-26 Jun 1998
Firstpage
2802
Abstract
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
Keywords
air traffic control; computational complexity; duality (mathematics); optimal control; quadratic programming; air traffic control; dual quadratic programming; heuristic; multiple conflict resolution; optimal control; polynomial-time; primal quadratic programming; Air traffic control; Aircraft; Airplanes; Algorithm design and analysis; Cost function; Game theory; Genetics; Optimal control; Polynomials; Quadratic programming;
fLanguage
English
Publisher
ieee
Conference_Titel
American Control Conference, 1998. Proceedings of the 1998
Conference_Location
Philadelphia, PA
ISSN
0743-1619
Print_ISBN
0-7803-4530-4
Type
conf
DOI
10.1109/ACC.1998.688365
Filename
688365
Link To Document