Comprehensive Research on Multi-factor Taxiing Path Planning for Hub Airports
Aiming at the problem of the insufficient capacity of taxiway in hub airport,based on the principles of safety interval,conflict resolution and fairness,the shortest taxiing path is taken as the optimization goal,and the taxiing path planning model is established considering fuel consumption and exhaust emission.The Dijkstra algorithm is used to transform the taxiing path into an adjacency matrix,and the conflict is solved in a weighted manner.Under the premise of ensuring zero conflict on the taxiway,the total taxiing distance is reduced.The actual operation data of a hub airport in China from 18:00 to 19:00 on a certain day in 2018 were combined with 19 runway nodes and 71 taxiway nodes for verification and analysis.The results show that the proposed taxiing path planning method is feasible,which can improve the taxiing efficiency of the airport surface and effectively reduce fuel consumption and pollutant emissions.
万方数据
维普
