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 language||English (US)|
|Title of host publication||Proceedings of the American Control Conference|
|Number of pages||5|
|State||Published - Dec 1 1998|