Abstract
This paper describes a new approach to sampling-based motion planning with PRM methods. Our aim is to compute good quality roadmaps that encode the multiple connectedness of the Cspace inside small but yet representative graphs, that capture well the different varieties of free paths. The proposed approach relies on a notion of path deformability indicating whether or not a given path can be continuously deformed into another existing one. By considering a simpler form of deformation than the one allowed between homotopic paths, we propose a method that extends the Visibility-PRM technique [12] to constructing compact roadmaps that encode a richer and more suitable information than representative paths of the homotopy classes. The Path Deformation Roadmaps also contain additional useful cycles between paths in the same homotopy class that can be hardly deformed into each other. First experiments presented in the paper show that our technique enables small roadmaps to reliably and efficiently capture the multiple connectedness of the space in various problems.
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
Bohlin, R., Kavraki, L.E.: Path planning using lazy prm. In: IEEE Int. Conf. on Robotics and Automation, pp. 521–528 (2000)
Choset, H., Lynch, K.M., Hutchinson, S., Kantor, G., Burgard, W., Kavraki, L.E., Thrun, S.: Principles of robot motion. MIT Press, Cambridge (2005)
Hatcher, A.: Algebraic Topology. Cambridge University Press, Cambridge (2002), http://www.math.cornell.edu/~hatcher/AT/ATpage.html
Kavraki, L.E., Svestka, P., Latombe, J.-C., Overmars, M.H.: Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation 12(4), 566–580 (1996)
Latombe, J.-C.: Robot Motion Planning. Kluwer Academic Publishers, Dordrecht (1991)
LaValle, S.M.: Planning Algorithms. Cambridge University Press, Cambridge (2004-2005), http://msl.cs.uiuc.edu/planning/
Nieuwenhuisen, D., Overmars, M.H.: Useful cycles in probabilistic roadmap graphs. In: IEEE Int. Conf. on Robotics and Automation, pp. 446–452 (2004)
Overmars, M.H., Svestka, P.: A probabilistic learning approach to motion planning. In: Goldberg, K., et al. (eds.) Algorithmic Foundations of Robotics (WAFR 1994), pp. 19–37. A.K. Peters (1995)
Schmitzberger, E., Bouchet, J.L., Dufaut, M., Didier, W., Husson, R.: Capture of homotopy classes with probabilistic road map. In: IEEE/RSJ Int. Conf. on Robots and Systems (2002)
Sekhavat, S., Svestka, P., Laumond, J.-P., Overmars, M.H.: Multi-level path planning for nonholonomic robots using semi-holonomic subsystems. International Journal of Robotics Research 17(8), 840–857 (1998)
Siméon, T., Laumond, J.-P., Lamiraux, F.: Move3d: a generic platform for path planning. In: IEEE Int. Symp. on Assembly and Task Planning (2001)
Siméon, T., Laumond, J.-P., Nissoux, C.: Visibility-based probabilistic roadmaps for motion planning. Advanced Robotics Journal 14(6), 477–494 (2000)
Sánchez, G., Latombe, J.-C.: On delaying collision checking in prm planning - application to multi-robot coordination. International Journal of Robotics Research 21(1), 5–26 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jaillet, L., Siméon, T. (2008). Path Deformation Roadmaps. In: Akella, S., Amato, N.M., Huang, W.H., Mishra, B. (eds) Algorithmic Foundation of Robotics VII. Springer Tracts in Advanced Robotics, vol 47. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68405-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-68405-3_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68404-6
Online ISBN: 978-3-540-68405-3
eBook Packages: EngineeringEngineering (R0)