摘要
研究了机场场面滑行路径动态规划问题。基于三种滑行冲突约束,建立了使航班总体滑行时间最短的动态优化模型。改进了传统的D*算法,提出了基于时间权值的冲突预测和代价修正函数。案例计算相比Dijkstra算法得到的结果减少了203 s,有效减少总滑行时间,提高场面运行效率。该算法不仅可以用于滑行路径的初始规划,也适用于场面实时滑行引导的实施。
The dynamic planning of taxi path was studied.Aimed at minimizing total taxi time,dynamic optimized model based on three types of taxi conflict constraints is built.Conventional D＊ algorithm was improved and two functions were introduced 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,but also applicable to the implementation of the surface movement guidance.
出处
《科学技术与工程》
北大核心
2015年第1期315-319,328,共6页
Science Technology and Engineering
基金
天津市应用基础与前沿技术研究计划(14JCQNJC08100)
中央高校基础科研业务费(3122014D042
3122014D041
3122014C022)资助
关键词
滑行路径
动态规划
冲突预测
D＊算法
taxi path
dynamic planning
conflict-forecasting
D＊ Algorithm
