TY - JOUR
T1 - Multiple-aircraft-conflict resolution under uncertainties
AU - Zhao, Peng
AU - Erzberger, Heinz
AU - Liu, Yongming
N1 - Funding Information:
The work related to this research was performed at the Prognostic Analysis and Reliability Assessment Lab at Arizona State University. The research reported in this paper was supported by funds from
Publisher Copyright:
© 2021, AIAA International. All rights reserved.
PY - 2021
Y1 - 2021
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85117591477&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85117591477&partnerID=8YFLogxK
U2 - 10.2514/1.G005825
DO - 10.2514/1.G005825
M3 - Article
AN - SCOPUS:85117591477
SN - 0731-5090
VL - 44
SP - 2031
EP - 2049
JO - Journal of Guidance, Control, and Dynamics
JF - Journal of Guidance, Control, and Dynamics
IS - 11
ER -