Abstract
Sampling based planners have been successful in path planning of robots with many degrees of freedom, but still remains ineffective when the configuration space has a narrow passage. We present a new technique based on a random walk strategy to generate samples in narrow regions quickly, thus improving efficiency of Probabilistic Roadmap Planners. The algorithm substantially reduces instances of collision checking and thereby decreases computational time. The method is powerful even for cases where the structure of the narrow passage is not known, thus giving significant improvement over other known methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lozano Perez, T.: Spatial planning: A configuration space approach. IEEE Transaction on Computers 32(2), 108–120 (1983)
Reif, J.H.: Complexity of the mover’s problem and generalization. In: Proc. of FOCS, pp. 421–427 (1979)
Carpin, S.: Randomized motion planning - a tutorial. International Journal of Robotics and Automation 21(3), 184–196 (2006)
Choset, H., et al.: Principles of Robot Motion: Theory algorithms and implementation. MIT Press, Cambridge (2005)
Kavraki, L.E., Svestka, P., Latombe, J.C., Overmars, M.H.: Probabilistic roadmap for path planning in high dimensional configuration spaces. IEEE Transaction on Robotics and Automation 12(4), 566–580 (1996)
Boor, V., Overmars, M.H., van der Stappen, A.F.: The Gaussian sampling strategy for probabilistic roadmap planners. In: Proceedings of the 1999 IEEE International Conference on Robotics and Automation, pp. 1018–1023 (1999)
Sun, Z., Hsu, D., Jiang, T., Kurniawati, H., Reif, J.H.: Narraow Passage Sampling for Probabilistic Roadmap Planning. IEEE Transaction on Robotics 21(5), 1105–1115 (2005)
Bera, T., Bhat, M.S., Ghose, D.: Preprocessing configuration space for improved sampling based path planning. In: ICEAE, Bangalore, India (2009)
Amato, N.M., Bayazit, O.B., Dale, L.K., Jones, C., Vallejo, D.: OBPRM: An obstacle-based PRM for 3D workspaces. In: Proc. 3rd Workshop Algorithmic Found. Robot., pp. 155–168 (1998)
Wilmarth, S.A., Amato, N.M., Stiller, P.F.: Motion planning for a rigid body using random networks on the medial axis of the free space. In: Proc. 15th Annu. ACM Symp. Computational Geometry, pp. 173–180 (1999)
Karatazas, I., Shreve, S.E.: Brownian Motion and Stochastic Calculus. Springer, Heidelberg (1988)
Hughes, B.D.: Random Walk and Random Environments, vol. 1. Clearson Press, Oxford (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bera, T., Seetharama Bhat, M., Ghose, D. (2010). An Efficient Random Walk Strategy for Sampling Based Robot Motion Planners. In: Vadakkepat, P., et al. Trends in Intelligent Robotics. FIRA 2010. Communications in Computer and Information Science, vol 103. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15810-0_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-15810-0_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15809-4
Online ISBN: 978-3-642-15810-0
eBook Packages: Computer ScienceComputer Science (R0)