Balakirsky, S.
and , D.
(2010),
Single-query, Bi-directional, Lazy Roadmap Planner Applied to Car-like Robots, 2010 IEEE International Conference on Robotics and Automation (ICRA2010), Anchorage, AK, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=905073
(Accessed December 26, 2024)
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
Single-query, Bi-directional, Lazy Roadmap Planner Applied to Car-like Robots
Published
Author(s)
, Denis Denis Dimitrov
Abstract
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
Download Paper
Keywords
Planning, robotics, probabilistic roadmaps
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.
Created May 8, 2010, Updated February 19, 2017