Primal-dual quadratic programming approach to multiple conflict resolution

Jae Hyuk Oh; Eric Feron

doi:10.1109/ACC.1998.688365

Primal-dual quadratic programming approach to multiple conflict resolution

Jae Hyuk Oh, Eric Feron

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

7 Scopus citations

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. © 1998 AACC.

Original language	English (US)
Title of host publication	Proceedings of the American Control Conference
Pages	2802-2806
Number of pages	5
DOIs	https://doi.org/10.1109/ACC.1998.688365
State	Published - Dec 1 1998
Externally published	Yes

Bibliographical note

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

Access to Document

10.1109/ACC.1998.688365

Cite this

@inproceedings{0d735c6cb6ad45849af6ad28a0709765,

title = "Primal-dual quadratic programming approach to multiple conflict resolution",

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. {\textcopyright} 1998 AACC.",

author = "Oh, {Jae Hyuk} and Eric Feron",

note = "Generated from Scopus record by KAUST IRTS on 2021-02-18",

year = "1998",

month = dec,

day = "1",

doi = "10.1109/ACC.1998.688365",

language = "English (US)",

isbn = "0780345304",

pages = "2802--2806",

booktitle = "Proceedings of the American Control Conference",

}

TY - GEN

T1 - Primal-dual quadratic programming approach to multiple conflict resolution

AU - Oh, Jae Hyuk

AU - Feron, Eric

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

PY - 1998/12/1

Y1 - 1998/12/1

N2 - 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.

AB - 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.

UR - http://ieeexplore.ieee.org/document/688365/

UR - http://www.scopus.com/inward/record.url?scp=84881329925&partnerID=8YFLogxK

U2 - 10.1109/ACC.1998.688365

DO - 10.1109/ACC.1998.688365

M3 - Conference contribution

SN - 0780345304

SP - 2802

EP - 2806

BT - Proceedings of the American Control Conference

ER -

Primal-dual quadratic programming approach to multiple conflict resolution

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this