首页 | 本学科首页   官方微博 | 高级检索  
     

一种满足方向约束的动态航迹规划方法*
引用本文:周璐,李军华. 一种满足方向约束的动态航迹规划方法*[J]. 计算机应用研究, 2018, 35(7)
作者姓名:周璐  李军华
作者单位:南昌航空大学,南昌航空大学
基金项目:国家自然科学基金(61440049,61262019);江西省自然科学基金(20161BAB202038);江西省科技厅重点研发基金(20161BBG70047);南昌航空大学研究生创新基金(YC2016046)
摘    要:针对动态环境下有方向约束航迹规划问题,提出一种结合引导点的动态航迹规划方法。该方法沿约束方向基于圆拓展的方式产生引导点,并自主选择代价最小的引导点,引导航迹规划算法向引导点区域搜索,提高了规划效率。仿真结果表明,改进算法可以适应动态变化的环境,也能满足从特定方向接近目标点的航迹规划要求。相比于传统D*算法,改进算法的航迹总代价更小,规划时间更短。

关 键 词:D*算法  动态环境  航迹规划  方向约束  引导点
收稿时间:2017-03-01
修稿时间:2018-05-29

A dynamic route planning method based on directional constraints
Zhou Lu and Li Junhua. A dynamic route planning method based on directional constraints[J]. Application Research of Computers, 2018, 35(7)
Authors:Zhou Lu and Li Junhua
Affiliation:School of Information Engineering,Nanchang Hangkong University,
Abstract:Aiming at the directional constraints path planning problem in dynamic environment, this paper proposed a dynamic path planning algorithm which combines 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.
Keywords:D * algorithm   dynamic environment    route planning   direction constraints   guide point
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号