By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jae-Hyuk Oh ; MIT, Cambridge, MA, USA ; E. Feron

Many future air traffic control tasks will require online 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 online 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

Published in:

American Control Conference, 1998. Proceedings of the 1998  (Volume:5 )

Date of Conference:

21-26 Jun 1998