Linear Matrix Inequalities for free flight conflict problems

J. Marc Shewchun, Jae Hyuk Oh, Eric Feron

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

11 Scopus citations

Abstract

Under the concept of Free Flight, aircraft will be allowed much greater flexibility in trajectory planning than ever before. The ability to anticipate and resolve conflicts provides one of the greatest challenges to this proposed environment. In this paper, the following problem is addressed; given two aircraft, their intended trajectories and uncertainty about their behavior, what is their worst-case miss distance over a given time horizon? This question is answered using Linear Matrix Inequalities and positive semi-definite programming. The proposed approach provides guaranteed lower bounds on minimum miss distances in polynomial time. Several increasingly complex examples are given that illustrate the efficiency of the proposed method.
Original languageEnglish (US)
Title of host publicationProceedings of the IEEE Conference on Decision and Control
PublisherIEEEPiscataway, NJ, United States
Pages2417-2422
Number of pages6
StatePublished - Dec 1 1997
Externally publishedYes

Fingerprint

Dive into the research topics of 'Linear Matrix Inequalities for free flight conflict problems'. Together they form a unique fingerprint.

Cite this