NTRS - NASA Technical Reports Server

Back to Results
Scenario Complexity for Unmanned Aircraft System TrafficThis work introduces an approach to estimate the complexity of a low-altitude air traffic scenario involving multiple UASs using mathematical programming. Given a set of multi-point UAS flight trajectories, vehicle dynamics, and a conflict resolution algorithm, an abstract model is developed such that it can be solved quickly using a mathematical programming optimization software without running high-fidelity simulations that can be computationally expensive and may not suit real-time apA quick and accurate assessment of complexity for a given traffic scenario can help plan and schedule flights to alleviate traffic bottleneck and mitigate operation risks, especially for unmanned aerial system traffic management where high traffic density or complexity is expected. This work introduces a traffic scenario complexity metric that was constructed based on the number of potential conflicts weighted by the conflict resolution cost associated. The cost associated with a conflict is calculated based on the corresponding conflict resolution maneuvers. To obtain the conflict resolution maneuvers, a MILP-based optimization was formulated with the vehicle model and conflict management parameters incorporated. To evaluate the complexity metrics, an approach of using measurements from high-fidelity simulations was proposed. The scenario complexity measurements for 920 random-generated scenarios were obtained through high-fidelity simulations and treated as the ground truth. Two statistics methods: Pearson and Alternative Conditional Expectations were applied for analysis. The results showed that the number of flights has low correlation with the scenario complexity according to the correlation coefficients calculated by both methods. The Alternative Conditional Expectations method shows that the proposed scenario complexity metric has better correlation with the ground truth than the number of potential conflicts.plications. In the abstract model, each vehicle is represented by a time-varied vector associated with position, speed, and heading information. The total extra distance that aircraft need to divert from their original routes to avoid collisions is computed and used to setup a quadratic programming formula. The metrics including the number of conflicts and extra distances travelled by all vehicles are then utilized to estimate the complexity of a given UAS flight scenario. Results and verification against high-fidelity simulations will be provided in the final draft.
Document ID
Acquisition Source
Ames Research Center
Document Type
External Source(s)
Xue, Min
(NASA Ames Research Center Moffett Field, CA, United States)
Do, Minh B.
(Stinger Ghaffarian Technologies Inc. (SGT Inc.) Moffett Field, CA, United States)
Date Acquired
July 25, 2019
Publication Date
June 17, 2019
Subject Category
Air Transportation And Safety
Report/Patent Number
Meeting Information
Meeting: AIAA Aviation Forum 2019
Location: Dallas, TX
Country: United States
Start Date: June 17, 2019
End Date: June 21, 2019
Sponsors: American Institute of Aeronautics and Astronautics (AIAA)
Funding Number(s)
Distribution Limits
Public Use Permitted.
traffic complexity
No Preview Available