Automated Conflict Resolution: A Simulation Evaluation Under High Demand Including Merging Arrivals

Abstract

Performance of a n automated conflict resolution algorithm is assessed. Evaluations are based on fast -time simulation s of 24 hours of nominal and heavily increased air traffic demand in the Cleveland Air Route T raffic C ontrol Center airspace. Departure, en -route, and arrival traffic were represented, based on recorded Host data . The algorithm is designed to resolve detected conflicts —projected to be between two and twenty minutes from first loss of separation —by amending the lateral, vertical, or longitudinal trajectory of one aircraft such that the conflict is resolved, no new conflicts are created, and the aircraft is returned to its original flight plan . The results indicate that the conflict resolution algorithm is ca pable of resolving conflicts safely and efficiently at traffic levels significantly higher than today under nominal conditions . Safety and efficiency metrics are offered as benchmarks for comparison with alternative algorithms.