Design and analysis of conflict resolution algorithms via positive semidefinite programming

Jae Hyuk Oh, J. Marc Shewchun, Eric Feron

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

13 Scopus citations

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 languageEnglish (US)
Title of host publicationProceedings of the IEEE Conference on Decision and Control
PublisherIEEEPiscataway, NJ, United States
Pages4179-4185
Number of pages7
StatePublished - Dec 1 1997
Externally publishedYes

Fingerprint Dive into the research topics of 'Design and analysis of conflict resolution algorithms via positive semidefinite programming'. Together they form a unique fingerprint.

Cite this