基于分支定界法的机场终端区单一进离场程序设计优化

Single Departure and Arrival Procedure Optimization in Airport Terminal Area Based on Branch and Bound Method

当前绝大部分机场进离场程序是通过人工设计并借助计算机辅助软件绘制完成的,在充分发挥空域资源方面仍有可提升空间。为此,文中提出了单一进离场程序设计的优化方法,以期为程序设计人员提供有效的决策支持。首先,结合所需导航性能(Required Navigation Performance RNP)的导航规范建立了进离场程序的三维模型,考虑了诸如障碍物规避等飞行限制条件;其次,对于每个障碍物给出了3种不同的规避方式,沿障碍物边缘顺时针或逆时针转弯,或在障碍物下方保持当前飞行高度;随后,应用分支定界法(Branch and Bacnd,B&B)对问题进行解算,其中分支策略对应障碍物的不同规避方式;最后,针对两种不同的障碍物布局结构对算法进行测试,并与传统的A~*算法比较计算耗时。仿真实验表明,所提算法能够在较短时间内计算出规避障碍物且符合RNP导航运行要求的最优路径;通过调整目标函数中权重系数的值,可以获得连续爬升或下降的程序,对于飞机降噪减排有积极影响。

Currently,the maJority of airport departure and arrival procedures are designed manually and drawn with the help of computer-aided software.There is still room for improvement in bringing airspace resources into full play.In order to provide effective decision support for actual procedure designers,an optimization methodology of single departure and arrival programming is proposed.Firstly,each route is modeled in three dimensions in compliance with the Required Navigation Performance(RNP),and flight restrictions such as obstacle avoidance are considered.Secondly,three different ways of obstacle avoidance aree proposed:bypassing clockwise or counter-clockwise along the obstacle boundary,or maintaining the current flight level below the obstacle.Then,a Branch and Bound(B&B)approach is developed,where the branching strategies corresponded to different ways of obstacle avoidance.Finally,the algorithm is tested for two different obstacle layout structures,and the computation time is compared with the A*algorithm.The results show that,the algorithm can provide optimal routes avoiding obstacles and conforming to the RNP requirements in a short computing time.Moreover,by adJusting different weight coefficients in the obJective function,the procedure of continuous climbing or descending can be obtained,which has positive impact for aircraft noise and emission reduction.