Automated conflict resolution, arrival management,and weather avoidance for air traffic management

摘要

This article describes a unified solution to three types of separation-assurance problems that occur in en-route airspace: separation conflicts, arrival sequencing, and weather-cell avoidance. Algorithms for solving these problems play a key role in the design of future air traffic management systems such as the US's NextGen. Because these problems can arise simultaneously in any combination, it is necessary to develop integrated algorithms for solving them. A unified and comprehensive solution to these problems provides the foundation for a future air traffic management system that requires a high level of automation in separation assurance. This article describes the three algorithms developed for solving each problem and then shows how they are used sequentially to solve any combination of these problems. The first set of algorithms resolves loss-of-separation conflicts. It generates multiple resolutions for each conflict and then selects the one giving the least delay. Two new algorithms, one for sequencing and merging of arrival traffic, referred to as the arrival manager, and the other for weather-cell avoidance are presented. Because these three problems constitute a substantial fraction of the workload of en-route controllers, integrated algorithms to solve them is a basic requirement for automated separation assurance. This article also reviews the advanced airspace concept, a proposed design for a ground-based system that postulates redundant systems for automated separation assurance in order to achieve both high levels of safety and airspace capacity. It is proposed that automated separation assurance be introduced operationally in several steps, each step reducing controller workload further while increasing airspace capacity. A fast time simulation was used to determine performance statistics of the algorithm at up to 3 x current traffic levels.