Abstract
In this paper, we discuss the field of sampling-based motion planning. In contrast to methods that construct boundary representations of configuration space obstacles, samplingbased methods use only information from a collision detector as they search the configuration space. The simplicity of this approach, along with increases in computation power and the development of efficient collision detection algorithms, has resulted in the introduction of a number of powerful motion planning algorithms, capable of solving challenging problems with many degrees of freedom. First, we trace how sampling-based motion planning has developed. We then discuss a variety of important issues for sampling-based motion planning, including uniform and regular sampling, topological issues, and search philosophies. Finally, we address important issues regarding the role of randomization in sampling-based motion planning.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lindemann, S.R., LaValle, S.M. (2005). Current Issues in Sampling-Based Motion Planning. In: Dario, P., Chatila, R. (eds) Robotics Research. The Eleventh International Symposium. Springer Tracts in Advanced Robotics, vol 15. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11008941_5
Download citation
DOI: https://doi.org/10.1007/11008941_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23214-8
Online ISBN: 978-3-540-31508-7
eBook Packages: EngineeringEngineering (R0)