期刊文献+

基于障碍物边界采样改进的Visibility-PRM算法 被引量:1

An Improved Visibility-PRM Algorithm Based on Obstacle Boundary Sampling Method
在线阅读 下载PDF
导出
摘要 首先分析解决机器人运动规划问题的Visibility-PRM算法。然后针对其在复杂工作空间运动规划中表现出的roadmap连通子图数多、可视性判断效率低等局限性,提出基于障碍物边界采样改进的Visibility-PRM算法(Obs-Visi-PRM)。通过改进采样和连通的策略,减少了roadmap的连通子图数,降低了碰撞检测次数。最后通过实例分析,证明Obs-Visi-PRM算法的有效性。 In robotic motion planning, Visibility -PRM algorithm has the shortcomings such as low connectivity,low effectiveness in visibility judgment etc.In this paper,we have proposed an improved Visibility-PRM algorithm(Obs-Visi- PRM)based on reformative obstacle boundary sampling method.This method adopts the strategy of improved sampling and connectivity,thus it can increase the connectivity of roadmap and reduce the detection times.Finally,some instances are analyzed and show Obs-Visi-PRM algorithm's effectiveness.
出处 《计算机工程与应用》 CSCD 北大核心 2005年第25期81-84,共4页 Computer Engineering and Applications
关键词 运动规划算法 ROADMAP 可视性 motion planning, Roadmap,visibility
  • 相关文献

参考文献7

  • 1M H Overmars.A random approach to motion planning[R].Department of Computer Science,Utrecht University,The Netherlands, 1992.
  • 2P Svestka.Robot motion planning using probabilistic road maps[D]. UrechtUniversity, 1997.
  • 3L E Kavraki,P Svestka,J C Latombe et al.Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces[J].IEEE Transactions on Robotics and Automation, 1996; 12(4) :566-580.
  • 4G S'anchez,J C Latombe.A Single-Query Bi-Directional Probabilistic Roadmap Planner with Lazy Collision Checking[J].Robotics Research, 2001.
  • 5J Kuffner,S Lavalle.RRT-Connect:An Efficient Approach to Single-Query Path Planning[M].Robotics and Automation,2000.
  • 6T Simeon,J-P Laumond.Visibility based probabilistic roadmaps for motion planning[J].Nissoux.Advanced Robotics Journal,2000;14(6).
  • 7Roland Geraerts,Mark H Overmar.Sampling Techniques for Probabilistic Roadmap Planners[R].Technical report UU-CS-2003-041,2003.

同被引文献40

引证文献1

二级引证文献70

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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