期刊文献+

动态环境下基于人工势场引导的RRT路径规划算法 被引量:24

Artificial potential field based RRT algorithm for path planning in dynamic environment
下载PDF
导出
摘要 现有的大多数动态RRT路径规划算法不能使规划的路径远离障碍物,这有可能导致机器人没有足够的避障时间。针对此问题,提出了一种利用人工势场引导快速扩展随机树向目标区域生长并远离障碍物的改进RRT算法APFG-RRT(artificial potential field guided RRT)。为了进一步加快算法的收敛速度、加速算法跳出局部极小值,引入了一种按自适应概率选择目标点作为采样点的策略;针对动态环境采用全局规划结合局部重新规划的方法以提高算法的实时性。仿真实验表明,相比于初始RRT和Goal-bias RRT,APFG-RRT的计算效率更高,内存需求更小,并且搜索到的路径能够有效地远离障碍物,提高了动态路径规划的成功率。 Most of the existing dynamic RRT path planning algorithms cannot keep the planned path away from obstacles,which may cause the robot to have insufficient time to avoid obstacles.To solve this problem,this paper proposed an improved RRT,denoted as APFG-RRT,which utilized artificial potential fields to guide the RRT grow to goal and away from obstacles.In order to further increase the convergence rate and speed up the jump out of local minima,it introduced a strategy of selecting the goal as the random sample at an adaptive probability.Finally,it adopted global planning combined with local replanning to improve its real-time performance in dynamic environment.Simulation experiments show that APFG-RRT has higher computational efficiency and lower memory requirements compared with the initial RRT and Goal-bias RRT,and the given path can be effectively away from obstacles,which improves the success rate of dynamic path planning.
作者 司徒华杰 雷海波 庄春刚 Situ Huajie;Lei Haibo;Zhuang Chungang(School of Mechanical Engineering,Shanghai Jiao Tong University,Shanghai 200240,China)
出处 《计算机应用研究》 CSCD 北大核心 2021年第3期714-717,724,共5页 Application Research of Computers
基金 国家自然科学基金资助项目(51775344)。
关键词 路径规划 RRT 人工势场 动态环境 局部重新规划 path planning RRT artificial potential fields dynamic environments local replanning
  • 相关文献

参考文献3

二级参考文献26

  • 1张智,朱齐丹,刘海,曾鹏.蒸汽发生器检修机械手运动学逆解[J].哈尔滨工程大学学报,2007,28(1):65-70. 被引量:7
  • 2KAVRALU L E, SVESTK A E Probabilistic poadmaps for path planning in high-dimensional configuration spaces[J]. IEEE Transactions on Robotics and Automation, 1996, 12(4): 566-580.
  • 3NANCY M A, YAN W. A randomized road-map method for path and manipulation planning[C]// Proceedings of the IEEE International Conference on Robotics and Automation, April 22- 28, 1996, Minneapolis. IEEE, 1996. 113-120.
  • 4BOOR V, OVERMARS M H, STAPPEN A F. The Gaussian sampling strategy for probabilistic roadmap planners[C]// Proceedings of the IEEE International Conference on Robotics and Automation, August 6-12, 1999, DetroitMI. IEEE, 1999: 1018-1023.
  • 5BOHLIN R, KAVRAKI L E. Path planning using lazy PRM[C]// Proceedings of the IEEE International Conference on Robotics and Automation, April 24 -28, 2000, San Francisco CA. IEEE, 2000: 521-528.
  • 6RIMON E, KODITSCHEK D. Exact robot navigation using artificial potential functions[J]. IEEE Trans. Robot Automat, 1992, 18: 501-518.
  • 7LINGELBACH E Path planning using probabilistic cell decomposition[C]// Proceedings of the IEEE International Conference on Robotics and Automation, April 26-May 1, 2004, New Orleans, LA. IEEE, 2004: 467-472.
  • 8EGE E S. A new approach to increase performance of rapidly-exploring random trees (RRT) in mobile robotics[C]// Proceedings of the IEEE International Conference on Robotics and Automation, April 17-19, 2006, Antalya. IEEE, 2006: 851-855.
  • 9GRAD A, MILITAO F, NADEN K. Improving RRT with context sensitivity[C]// Proceedings of the IEEE International Conference on Robotics and Automation, April 3, 2010, Detroit MI. IEEE, 2010: 1-5.
  • 10STRANDBRG M. Augmenting RRT-planners with local trees[C]// Proceedings of the IEEE International Conference on Robotics and Automation, April 26-May 1, DetroitMI. IEEE, 2004: 3258-3262.

共引文献83

同被引文献200

引证文献24

二级引证文献49

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部