基于冲突避免的滑行路径动态分配问题研究  

Research of the Dynamic Conflict Avoidance Taxiing Path Assignment

作　　者：花琦[1] 王帮峰[1] 钱小燕[1] 丁萌[1] 

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

出　　处：《中国民航飞行学院学报》2014年第3期8-11,共4页Journal of Civil Aviation Flight University of China

基　　金：中国民航科技项目(MHRD201124);中国博士后科学基金(20110491415);中央高校基本科研业务经费(NO.NS2012026)

摘　　要：在保证地面飞行安全的前提下,为解决机场容量不足,减少航班延误,本文提出基于冲突避免的滑行道分配问题研究。在改进的Dijkstra算法的基础之上,结合机场场面运行规则、滑行冲突以及优先级限制等因素构建滑行道动态网络模型,给出不同冲突类型下的滑行时间求解方法。仿真实验表明,与未考虑滑行冲突的固定路径相比,动态滑行路径计算方法计算出的滑行路径可避免滑行冲突,一定程度上可缓解机场地面繁忙状态。Under the premise of the ground flight safety, in order to solve the lack of airport capacity and reduce flight delays, this paper proposes the taxiway allocation based on the conflict avoidance. On account of the improved Dijkstra algorithm, the airport operation rules and taxi conflicts as well as priority constraints, the dynamic network model is constructed. And finally this paper gives the way to solve taxi time allocation under different types of conflicts. Simulation results show that compared with fixed path without consideration of taxiing conflict, the new method to calculate taxiing path can effectively avoid conflicts and ease the busy status of the airport ground in some extent.

关 键 词：机场滑行调度 动态网络 滑行冲突 最短路径 改进DIJKSTRA算法 

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