Study on 4D taxiing path planning of aircraft based on spatio-temporal network

Abstract

In recent years, China vigorously develops energy conservation and emission reduction, in order to actively respond to the national call to make the aircraft operation process reduce unnecessary costs and strengthen the safety of the aircraft taxiing process. This paper studies the spatio-temporal network model and dynamic planning algorithm to plan the aircraft taxiing path. First, the relationship between the force, thrust and engine fuel consumption rate during aircraft taxiing is analyzed to determine the fuel consumption rate during aircraft taxiing. Then, a two-dimensional directed graph of airport network nodes is constructed. The state of the aircraft is recorded when considering the dynamic characteristics of the node sections, the taxiing path is determined for the aircraft using dijkstra's algorithm, and the overall taxiing path is discretized from node to node using dynamic planning to design a mathematical model with the shortest taxiing distance as the goal. At the same time, the optimal taxiing path is planned for the aircraft in the process of avoiding aircraft conflicts. Thus, a state-attribute-space-time field taxiing path network is established. Through example simulations, simulation data are finally obtained to plan conflict-free paths for six aircraft, the total fuel consumption for the six aircraft planning is 564.29 kg, and the total taxiing time is 1765s. This completed the validation of the dynamic planning algorithm of the spatio-temporal network model.

Keywords

• spatio-temporal network model
• path optimization
• dynamic programming
• dijkstra's algorithm
• mathematical model