Safety certification of air traffic conflict resolution algorithms involving more than two aircraft

Jae Hyuk Oh, Eric Feron

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

4 Scopus citations

Abstract

Many future air traffic control tasks will require on-line safety-critical optimization algorithms. Among these tasks, real-time air traffic conflict resolution involving more than two aircraft is one of the most challenging. Air traffic control systems based on on-line optimization algorithms must face safety-certification issues such as guaranteed feasibility and guaranteed time of computation. This paper deals with the question of guaranteed feasibility and presents an initial effort at developing an off-line procedure to prove the safety of such an algorithm. The procedure is based on convex optimization technology combined with the so-called S-procedure. © 1998 AACC.
Original languageEnglish (US)
Title of host publicationProceedings of the American Control Conference
Pages2807-2811
Number of pages5
DOIs
StatePublished - Dec 1 1998
Externally publishedYes

Fingerprint Dive into the research topics of 'Safety certification of air traffic conflict resolution algorithms involving more than two aircraft'. Together they form a unique fingerprint.

Cite this