Air traffic controller supervisors configure available sector, operating position, and workstation resources to safely and efficiently control air traffic in a region of airspace. In this paper, an algorithm for assisting supervisors with this task is described and demonstrated on two example problem instances. The algorithm produces configuration-schedule advisories that minimize a cost. The cost is a weighted sum of two competing costs: one penalizing mismatches between configurations and predicted air traffic and another penalizing the effort associated with changing configurations. The problem considered by the algorithm is a shortest-path problem. The parameter determining the relative importance of the two competing costs is tuned by comparing historical configurations with corresponding algorithm advisories. Furthermore, some operationally-meaningful metrics are computed with the results of simulations of the algorithm for various values of this parameter. Two example problem instances for which appropriate configuration advisories are obvious were designed to illustrate characteristics of the algorithm. The results demonstrate how the algorithm suggests advisories that appropriately use changes in airspace configurations and changes in the number of operating positions allocated to each open sector. The results also demonstrate how the advisories suggest appropriate times for configuration changes.
Advisory Algorithm for Scheduling Open Sectors, Operating Positions, and Workstations
Journal of Guidance, Control, and Dynamics ; 37 , 4 ; 1158-1169
2014-03-21
12 pages
Article (Journal)
Electronic Resource
English
Advisory Algorithm for Scheduling Open Sectors, Operating Positions, and Workstations
Online Contents | 2014
|ADVISORY ALGORITHM FOR SCHEDULING OPEN SECTORS, OPERATING POSITIONS, AND WORKSTATIONS
British Library Conference Proceedings | 2012
|Redesigning Workstations Utilizing Motion Modification Algorithm
SAE Technical Papers | 2003
|British Library Online Contents | 1994
|