Loading…
Multiple-Aircraft-Conflict Resolution Under Uncertainties
A new method for efficient trajectory planning to resolve potential conflicts among multiple aircraft is proposed. A brief review of aircraft trajectory planning and conflict resolution methods is given first. Next, a new method is proposed that is based on a probabilistic conflict risk map using th...
Saved in:
Published in: | Journal of guidance, control, and dynamics control, and dynamics, 2021-11, Vol.44 (11), p.2031-2049 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | A new method for efficient trajectory planning to resolve potential conflicts among multiple aircraft is proposed. A brief review of aircraft trajectory planning and conflict resolution methods is given first. Next, a new method is proposed that is based on a probabilistic conflict risk map using the predicted probability of conflict with the intention information of the intruders. The risk-map-based method allows the path planning algorithm to simultaneously account for many uncertainties affecting safety, such as positioning error, wind variability, and human errors. Following this, A* algorithm is used to find the cost-minimized trajectory for a single aircraft by considering all other aircraft as intruders. Search heuristic method is implemented to iterate the A* algorithm for all aircraft to optimize the trajectory planning. Convergence and computation efficiency of the proposed method are investigated in detail. Numerical examples are used to illustrate the effectiveness of the proposed method under several important scenarios for air traffic control, such as wind effects, non-cooperative aircraft, minimum disturbance of pilots, and deconflict with flight intent information. Several conclusions are drawn based on the proposed method. |
---|---|
ISSN: | 1533-3884 0731-5090 1533-3884 |
DOI: | 10.2514/1.G005825 |