摘要
针对动态环境下有方向约束航迹规划问题,提出一种结合引导点的动态航迹规划方法。该方法沿约束方向基于圆拓展的方式产生引导点,并自主选择代价最小的引导点,引导航迹规划算法向引导点区域搜索,提高了规划效率。仿真结果表明,改进算法可以适应动态变化的环境,也能满足从特定方向接近目标点的航迹规划要求。相比于传统D*算法,改进算法的航迹总代价更小、规划时间更短。
Aiming at the directional constraints path planning problem in dynamic environment,this paper proposed a dynamic path planning algorithm which combined the guide points. The algorithm generated guide points on the basis of the circle expansion method along the constraints direction,and then selected the least cost guide point to guide the planning algorithm to search the guide points region. Finally it could improve the overall planning efficiency. The simulation results show that the improved algorithm can adapt to the dynamic environmental changes,as well as plan the resultant path to the target point which goes from the specific direction. Compared with the traditional D＊ algorithm,the total path cost of the improved algorithm is smaller and the planning time is shorter.
作者
周璐
李军华
Zhou Lu;Li Junhua(School of Information Engineering,Nanchang Hangkong University,Nanchang 330063,China)
出处
《计算机应用研究》
CSCD
北大核心
2018年第7期1982-1985,1988,共5页
Application Research of Computers
基金
国家自然科学基金资助项目(61440049
61262019)
江西省自然科学基金资助项目(20161BAB202038)
江西省科技厅重点研发基金资助项目(20161BBG70047)
南昌航空大学研究生创新基金资助项目(YC2016046)
关键词
D＊算法
动态环境
航迹规划
方向约束
引导点
D ＊ algorithm
dynamic environment
path planning
direction constraints
guide point
