摘要
针对大型繁忙机场交通冲突频发、起飞延误等问题,在战略和战术层面分别对机场场面滑行路径规划方法展开研究。简化了机场路网结构,将滑行路径规划与进离场序列结合,建立了航空器总体滑行耗时最短,延误最少的动态优化模型。在比较了流行的机场滑行路经规划算法基础上,从战术规划的角度提出了一种新的基于A~*算法的场面滑行动态规划方法和冲突解脱策略。案例仿真结果表明该方法可以快速有效的减少航空器总体滑行时间和解决滑行冲突,实现机场场面运行效率提升和机场运营的自动化。
Aimed at the problems that frequently traffic accidents arise and takeoff delays in large busy airports,this paper studies the taxi path planning method of airport scene at the strategic and tactical level respectively.The paper simplifies the structure of the airport network,combines the taxiway path planning with the departure sequence,and establishes a dynamic optimization model with the shortest and least delay in the overall taxiing of the aircraft.On the basis of the compared the popular airport taxi route planning algorithm,the paper proposes a new scene sliding dynamic programming method and conflict relief strategy based on A~＊ algorithm from the perspective of tactical planning.The simulation results show that this method can quickly and effectively reduce the overall taxiing time of the aircraft and solve the taxi conflict,thus improving the efficiency of the airport scene and the automatic operation of the airport.
作者
刘帆
张学军
马国亮
刘玲
LIU Fan ZHANG Xuejun MA Guoliang LIU Ling(School of Electronic and Information Engineering, Beihang University, Beijing 100191, China Air Traffic Control and Navigation College, Air Force Engineering University, Xi＇an 710051, China Intelligence Section, Air Force Equipment Research Institute, Beijing 100085, China)
出处
《空军工程大学学报（自然科学版）》
CSCD
北大核心
2017年第4期19-23,共5页
Journal of Air Force Engineering University(Natural Science Edition)
基金
国家自然科学基金(U1533119)
国家自然科学基金创新群体项目(61221061)
关键词
场面运行
交通冲突
动态规划
A＊算法
surface operation
traffic conflict
dynamic programming
A＊ algorithm
