期刊文献+

A Configuration Deactivation Algorithm for Boosting Probabilistic Roadmap Planning of Robots 被引量:4

A Configuration Deactivation Algorithm for Boosting Probabilistic Roadmap Planning of Robots
下载PDF
导出
摘要 We present a method to improve the execution time used to build the roadmap in probabilistic roadmap planners. Our method intelligently deactivates some of the configurations during the learning phase and allows the planner to concentrate on those configurations that axe most likely going to be useful when building the roadmap. The method can be used with many of the existing sampling algorithms. We ran tests with four simulated robot problems typical in robotics literature. The sampling methods applied were purely random, using Halton numbers, Gaussian distribution, and bridge test technique. In our tests, the deactivation method clearly improved the execution times. Compared with pure random selections, the deactivation method also significantly decreased the size of the roadmap, which is a useful property to simplify roadmap planning tasks. We present a method to improve the execution time used to build the roadmap in probabilistic roadmap planners. Our method intelligently deactivates some of the configurations during the learning phase and allows the planner to concentrate on those configurations that axe most likely going to be useful when building the roadmap. The method can be used with many of the existing sampling algorithms. We ran tests with four simulated robot problems typical in robotics literature. The sampling methods applied were purely random, using Halton numbers, Gaussian distribution, and bridge test technique. In our tests, the deactivation method clearly improved the execution times. Compared with pure random selections, the deactivation method also significantly decreased the size of the roadmap, which is a useful property to simplify roadmap planning tasks.
机构地区 Computer Sciences
出处 《International Journal of Automation and computing》 EI 2012年第2期155-164,共10页 国际自动化与计算杂志(英文版)
关键词 Probabilistic roadmaps motion planning collision avoidance sampling algorithms robotics. Probabilistic roadmaps, motion planning, collision avoidance, sampling algorithms, robotics.
  • 相关文献

参考文献39

  • 1H.Choset. Principles of Robot Motion: Theory,Algorithms,and Implementations[M].USA:MIT Press,2005.
  • 2S.M.LaValle. Planning Algorithms[M].Cambridge:Cambridge University Press,2006.
  • 3L.E.Kavraki,P.(S)vestka,J.C.Latombe,M.H.Overmars. Probabilistic roadmaps for path planning in highdimensional configuration spaces[J].IEEE Transactions on Robotics and Automation,1996,(04):566-580.
  • 4M.H.Overmars. A Random Approach to Motion Planning.[Technical Report RUU-CS-92-93][R].Department of Computer Science,Utrecht University,the Netherlands,1992.
  • 5J.H.Reif. Complexity of the mover's problem and generalizations[A].IEEE,San Juan,Puerto Rico,1979.421-427.
  • 6J.F.Canny. The Complexity of Robot Motion Planning[M].Cambridge,MA,USA:MIT Press,1988.
  • 7T.Lozano-Pérez. Spatial planning:A configuration space approach[J].IEEE Transactions on Computers,1983,(02):108-120.
  • 8J.B.Kuipers. Quaternions and Rotation Sequences: A Primer with Applications to Orbits,Aerospace and Virtual Reality[M].Princeton,new Jersey:princeton University Press,2002.
  • 9J.C.Latombe. Robot Motion Planning[M].Boston,USA:Springer,1991.
  • 10O.Khatib. Real-time obstacle avoidance for manipulators and mobile robots[J].International Journal of Robotics Research,1986,(01):90-98.

同被引文献41

引证文献4

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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