基于D*算法的场面滑行动态规划研究

研究了机场场面滑行路径动态规划问题.基于三种滑行冲突约束,建立了使航班总体滑行时间最短的动态优化模型.改进了传统的D*算法,提出了基于时间权值的冲突预测和代价修正函数.案例计算相比Dijkstra算法得到的结果减少了203s,有效减少总滑行时间,提高场面运行效率.该算法不仅可以用于滑行路径的初始规划,也适用于场面实时滑行引导的实施.

Research on Dynamic Planning of Taxi Path Based on D* Algorithm

In this paper,we studied dynamic planning of taxi path. Aimed at minimizing total taxi time,dynamic optimized model based on three types of taxi conflict constraints is built. Improved conventional D* algorithm and introduced two functions used for forecasting conflict and modifying cost based on time weight. Through simulation,the result shows a reduced total taxi time and a better operational efficiency in comparison with the Dijkstra algorithm. D* algorithm can be used not only for the initial planning of the taxi path, is also applicable to the implementation of the surface movement guidance.