Latest revision as of 07:48, 2 February 2021

Abstract

In air traffic management, conflict detection algorithms are used to determine whether or not aircraft are predicted to lose horizontal and vertical separation minima within a time interval assuming a trajectory model. In the case of linear trajectories, conflict detection algorithms have been proposed that are both complete, i.e., they detect all conflicts, and sound, i.e., they do not present false alarms. In general, for arbitrary nonlinear trajectory models, it is possible to define detection algorithms that are either sound or complete, but not both. This paper considers the case of nonlinear aircraft trajectory models based on polynomial functions. In particular, it proposes a conflict detection algorithm that precisely determines whether, given a lookahead time, two aircraft flying polynomial trajectories are in conflict. That is, it has been formally verified that, assuming that the aircraft trajectories are modeled as polynomial functions, the proposed algorithm is both sound and complete.

Original document

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

• http://pdfs.semanticscholar.org/5b0c/a1f2da51702080231b4f4c8bba3f70cda457.pdf

• http://arc.aiaa.org/doi/pdf/10.2514/6.2015-0795,

http://dx.doi.org/10.2514/6.2015-0795

• https://ntrs.nasa.gov/archive/nasa/casi.ntrs.nasa.gov/20150006039.pdf,

https://ntrs.nasa.gov/search.jsp?R=20150006039,

https://arc.aiaa.org/doi/pdfplus/10.2514/6.2015-0795,

https://academic.microsoft.com/#/detail/2100211971