基于改进A＊算法的进离场航线网络3D规划  

3D Optimization for Arrival and Departure Route Network Based on Improved A＊ Algorithm

作　　者：贺超男 王超[1] 姜玉芹[2] 

机构地区：[1]中国民航大学空中交通管理学院,天津300300 [2]深圳航空有限责任公司江苏分公司,江苏南京210000

出　　处：《航空计算技术》2014年第1期45-47,51,共4页Aeronautical Computing Technique

基　　金：国家自然科学基金项目资助(61039001);国家科技支撑计划项目资助(2011BAH24B08);中央高校基本科研业务费资助(3122013SY05)

摘　　要：为提高终端空域航线设计的自动化水平,对进离场航线进行了研究。针对独立航线规划,提出角度扩展航路点搜索方法,提高算法运行效率。选取水平剖面经济性最优为目标函数,垂直剖面满足最优爬升/下降剖面,实现3D航线网络规划。实例结果表明,在保证航线安全性、经济性的同时,算法运行稳定,效率明显提高。In order to improve the automation level of the design of flight path in terminal airspace, the ap- proach and departure routes are studied. According to the optimization of the independent route, the search method which the horizontal direction is prior than the vertical direction is proposed, choose the optimum of the horizontal profile efficiency as the objective function, and make the vertical profile meet the demands of the optimum in the climb/descent profile. Extend the route the search space,achieve the optimization of route network in the 3D. Examp through the angle to reduce le results show that to ensure the safety and economic efficiency of the route at the same time, the algorithm is stable, and the operating efficiency is improved significantly.

关 键 词：空域设计 航线网络 Ⅳ算法 最优爬升 下降剖面 

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