The Single-query, Bi-directional, Lazy roadmap (SBL) algorithm successfully builds upon the traditional Probabilistic Roadmaps (PRM) approach by introducing a number of related optimizations. While these optimizations are applicable in the domain of car-like robots, the non-holonomic constraints of these systems and non-independence of several of their degrees of freedom pose challenges that will be examined in this paper. We present several enhancements that improve the quality of the generated path in comparison with the simple adaptation of the SBL algorithm. Results demonstrate that this work provides a planner that quickly and reliably discovers efficient paths for car-like robots.
Proceedings Title: 2010 IEEE International Conference on Robotics and Automation (ICRA2010)
Conference Dates: May 3-8, 2010
Conference Location: Anchorage, AK
Pub Type: Conferences
Planning, robotics, probabilistic roadmaps