Research on Surface Glide Path Planning Based on Improved A?Algorithm
With the continuous recovery of China's civil aviation traffic,the operating pressure of airport taxiways is increasing day by day,and it is urgent to plan the taxiing path of aircraft under busy condi-tions.In this paper,an in-depth analysis is made on the operation process of the aircraft on the taxiway,and the goal of the lowest taxiing fuel consumption is designed.Considering three kinds of conflicts during the taxiing process,the aircraft taxiing constraint model is established,and the problem of the taxiing con-flict relief based on the minimum energy consumption and flight priority is solved.Then,A composite al-gorithm combining Dijkstra algorithm and A∗algorithm is designed.Finally,the model is verified by the flight data of an airport in Nanjing during busy hours.The simulation results show that the model estab-lished in this paper can efficiently assign the dynamic process of aircraft taxiing,reduce the number of flight conflicts and fuel consumption costs compared with the four comparison algorithms,and can effec-tively solve the model while meeting the time requirements.
NETL
NSTL
万方数据
