A Mathematical Formulation for Planning Automated Aircraft Separations for AERA 3
Abstract
An algorithm, called Gentle-Strict (GS), is given for automated resolution of crossing conflicts between two aircraft, using parallel lateral offset maneuvers. Though other algorithms have been proposed for this purpose, GS uniquely facilitates quantitative analysis of the conflict resolution process itself, as well as quantitative analysis of the links between pairwise conflict resolution and longer lookahead air traffic control strategies. The main result of this document is a closed-form mathematical formula which relates parameterizations of (a) the encounter geometry, (b) the pathkeeping uncertainties, (c) the minimum separation achieved by GS, and (d) The gentleness of parallel lateral offset resolution maneuvers (as parameterized by magnitude of offset and by induced delay upon the aircraft).
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 01, 1989
- Accession Number
- ADA212316
Entities
People
- William P. Niedringhaus
Organizations
- MITRE Corporation