基于复合A^(*)算法的机场滑行道路径规划研究  

Research on Surface Glide Path Planning Based on Improved A^(*)Algorithm

作　　者：徐泽楷 周航[1] 徐嘉闻 汪玥 XU Ze-kai;ZHOU Hang;XU Jia-wen;WANG Yue(Nanjing University of Aeronautics and Astronautics,Nanjing 210000,China)

机构地区：[1]南京航空航天大学,江苏南京210000

出　　处：《航空计算技术》2024年第4期66-70,75,共6页Aeronautical Computing Technique

基　　金：国家自然科学基金委员会——中国民用航空局民航联合研究基金重点项目资助(U2233208)。

摘　　要：随着我国民航运输量的不断回升,机场滑行道的运行压力日渐增加,规划繁忙条件下航空器的滑行路径亟待解决。在对进离场航空器在滑行道的运行过程进行深入分析的基础上,设计了滑行油耗最低的目标,考虑到航空器滑行过程中的3种冲突,建立了航空器滑行约束模型,并解决了基于最小能耗和航班优先级的滑行冲突的解脱问题,然后设计了Dijkstra算法和A^(*)算法结合的复合求解算法。最终以南京某机场繁忙时间段的航班数据对模型进行验证。仿真结果表明,模型可以高效地对航空器的滑行过程进行动态分配,与4种对比算法相比减少了航班冲突次数和油耗成本,能够在满足时间要求的同时有效地对模型进行求解。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 conditions.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 conflict relief based on the minimum energy consumption and flight priority is solved.Then,A composite algorithm 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 established 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 effectively solve the model while meeting the time requirements.

关 键 词：场面调度 路径规划 滑行道优化 冲突解脱 A^(*)算法 

分 类 号：V355[航空宇航科学与技术—人机与环境工程]