Abstract

In air traffic management, conflict prevention information refers to the guidance maneuvers, which if taken, ensure that an aircraft's path is conflict-free. These guidance maneuvers take the form of changes to track angle or ground speed. Conflict prevention information may be assembled into prevention bands that advise the crew on maneuvers that should not be taken. Unlike conflict resolution systems, which presume that the aircraft already has a conflict, conflict prevention systems show conflicts for any maneuver, giving the pilot confidence that if a maneuver is made, then no near-term conflicts will result. Because near-term conflicts can lead to safety concerns, strong verification of information correctness is required. This paper presents a mathematical framework to analyze the correctness of algorithms that produce conflict prevention information incorporating an arbitrary number of traffic aircraft and with both a near-term and intermediate-term lookahead times. The framework is illustrated with a formally verified algorithm for 2-dimensional track angle prevention bands.


Original document

The different versions of the original document can be found in:

http://dx.doi.org/10.2514/6.2009-6907
https://ntrs.nasa.gov/search.jsp?R=20090034971,
https://repository.exst.jaxa.jp/dspace/handle/a-is/252763,
https://academic.microsoft.com/#/detail/2090327358
  • [ ]
Back to Top

Document information

Published on 01/01/2009

Volume 2009, 2009
DOI: 10.2514/6.2009-6907
Licence: CC BY-NC-SA license

Document Score

0

Views 0
Recommendations 0

Share this document

Keywords

claim authorship

Are you one of the authors of this document?