{'fraction_non_alphanumeric': 0.01862464183381089, 'fraction_numerical': 0.0057306590257879654, 'mean_word_length': 5.378995433789954, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
AUTOMATED CONFLICT RESOLUTION – A SIMULATION-BASED SENSITIVITY STUDY OF AIRSPACE AND DEMAND

The performance of an automated conflict resolution algorithm was investigated in terms of its sensitivity to specific airspace regions and increased traffic demand. The algorithm is envisioned as part of an automated separation assurance function in a future air traffic control system. It was tested in a non-real-time simulation of current-day and heavily increased demand scenarios, based on 24-hour data recordings from the Cleveland, Fort Worth and New York Air Route Traffic Control Centers. This traffic included the complete spectrum of aircraft types, flight phases and conflict geometries. The algorithm computes a fourdimensional conflict-resolution trajectory between two and twenty minutes prior to the projected loss of separation. The resolution trajectory begins at an aircraft’s current position and ends at a downstream point along its original flight path, while maneuvering clear of the detected conflict and causing no new conflicts. The results support two findings: (1) for traffic demand levels up to three times that of 2007, the algorithm was able to resolve all of the detected conflicts in all of the selected airspace regions; (2) the characteristics of the airspace and the traffic demand significantly influenced the operational efficiency of the resolution trajectories.