PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Tactical conflict detection and resolution in a 3-d airspace
Tactical conflict detection and resolution in a 3-d airspace
A review of conflict detection and resolution modeling methods
IEEE Transactions on Intelligent Transportation Systems
Proceedings of the Symposium on Human Interface 2009 on Human Interface and the Management of Information. Information and Interaction. Part II: Held as part of HCI International 2009
Formal Verification of Curved Flight Collision Avoidance Maneuvers: A Case Study
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Differential dynamic logics: automated theorem proving for hybrid systems
Differential dynamic logics: automated theorem proving for hybrid systems
Formal verification of distributed aircraft controllers
Proceedings of the 16th international conference on Hybrid systems: computation and control
Hi-index | 0.00 |
Highly accurate positioning systems and new broadcasting technology have enabled air traffic management concepts where the responsibility for aircraft separation resides on pilots rather than on air traffic controllers. The Formal Methods Group at the National Institute of Aerospace and NASA Langley Research Center has proposed and formally verified an algorithm, called KB3D, for distributed three dimensional conflict resolution. KB3D computes resolution maneuvers where only one component of the velocity vector, i.e., ground speed, vertical speed, or heading, is modified. Although these maneuvers are simple to implement by a pilot, they are not necessarily optimal from a geometrical point of view. In general, optimal resolutions require the combination of all the components of the velocity vector. In this paper, we propose a two dimensional version of KB3D, which we call KB2D, that computes resolution maneuvers that are optimal with respect to ground speed and heading changes. The algorithm has been mechanically verified in the Prototype Verification System (PVS). The verification relies on algebraic proof techniques for the manipulation of the geometrical concepts relevant to the algorithm as well as standard deductive techniques available in PVS.