Abstract
Recently, sampling-based path planning algorithms have been implemented in many practical robotics tasks. However, little improvements have been dedicated to the returned solution (quality) and sampling process. The aim of this paper is to introduce a new technique that improves the classical rapidly-exploring random trees (RRT) algorithm. First, the sampling step is modified in order to increase the number of possible solutions in the free space. Second, within the possible solutions, we apply an optimization scheme that gives the best solution in term of safety and shortness. The proposed solution, namely, rapidly-exploring random snakes (RRS) is a combination of a modified deformable Active Contours Model (called Snakes) and the RRT. The RRS takes the advantage of both RRT and deformable Snakes contours, respectively, in: rapidly searching new candidate nodes in the free space and circumnavigating obstacles by calculating a safe sub-path in the free space toward the new node created by the RRT. In comparison to the classical RRT, the proposed algorithm increases the probability of completeness, accelerates the convergence and generates a much safer and shorter open-loop solution, hence, increasing considerably the efficiency of the classical RRT. The proposed approach has been validated via numerical simulations and experimental results with a mobile robot.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
LaValle, S. M., Planning algorithms. University of Illinois 1999–2004.
J.C. Latombe, “Robot Motion Planning”, Norwell, MA: Kluwer, 1991.
B. Chazelle. Approximation and decomposition of shapes. In J. T. Schwartz and C. K. Yap, editors, Algorithmic and Geometric Aspects of Robotics, pages 145–185. Lawrence Erlbaum Associates, Hillsdale, NJ, 1987.
Kuffner, J.J.; LaValle, S.M., “RRT-connect: An efficient approach to single-query path planning,” IEEE International Conference on Robotics and Automation, vol. 2, no., pp. 995–1001, 2000.
Ryad Chellali, Emmanuel Bernier, Khelifa Baizid, Mohamed Zaoui, “Interface for Multi-robots Based Video Coverage”, International Conference on Human-Computer Interaction, Vol. 6769, 2011, pp 203–210.
R. Pepy and M. Kieffer and E. Walter, "Reliably Safe Path Planning Using Interval Analysis", Progress in Industrial Mathematics at ECMI 2008, Mathematics in Industry 2010, pp 583–588.
Karaman, S., Frazzoli, E.: Sampling-based Algorithms for Optimal Motion Planning. IJRR 30(7), 846–894, 2011.
Bry, A.; Roy, N., “Rapidly-exploring Random Belief Trees for motion planning under uncertainty,” Robotics and Automation (ICRA), 2011 IEEE International Conference on, vol., no., pp. 723–730, 9–13 May 2011.
Garcia, I.; How, J.P., “Improving the Efficiency of Rapidly-exploring Random Trees Using a Potential Function Planner,” 44th IEEE Conference on Decision and Control and European Control Conference, vol., no., pp. 7965–7970, 12–15 Dec. 2005.
M. Kass, A. Witkin, and D. Terzopoulos, “Snakes: Active contour models”, Int. J. Computer Vision, vol. 1, pp. 321–331 1988.
Khatib, O., “Real-time obstacle avoidance for manipulators and mobile robots,” International Conference on Robotics and Automation. Proceedings., vol. 2, no., pp. 500–505, Mar 1985.
Warren, C.W., “Global path planning using artificial potential fields,” International Conference on Robotics and Automation, 1989. Proceedings., pp. 316,321 vol. 1, 14–19 May 1989.
Bhattacharya, P.; Gavrilova, M.L., “Roadmap-Based Path Planning - Using the Voronoi Diagram for a Clearance-Based Shortest Path,” Robotics & Automation Magazine, IEEE, vol. 15, no. 2, pp. 58–66, June 2008.
Mark de Berg, Otfried Cheong, Marc van Kreveld, and Mark Overmars. 2008. Computational Geometry: Algorithms and Applications, TELOS, Santa Clara, CA, USA.
Kavraki, L.E.; Svestka, P.; Latombe, J.-C.; Overmars, M.H., “Probabilistic roadmaps for path planning in high-dimensional configuration spaces,” IEEE Transactions onRobotics and Automation, vol. 12, no. 4, pp. 566–580, Aug 1996.
S. M. Lavalle and J. J. Kuffer, “Rapidly-exploring Random Trees: Progress and prospects”, Workshop on the Algorithmic Foundations of Robotics, 2000.
Burns, B.; Brock, O., “Single-Query Motion Planning with Utility-Guided Random Trees,” International Conference on Robotics and Automation, vol., no., pp. 3307–3312, 10–14 April 2007.
Akgun, B.; Stilman, M., “Sampling heuristics for optimal motion planning in high dimensions,” International Conference on Intelligent Robots and Systems (IROS), vol., no., pp. 2640–2645, 25–30 Sept. 2011.
Samuel Rodriguez, Xinyu Tang, Jyh-Ming Lien and Nancy M. Amato, “An Obstacle-Based Rapidly-Exploring Random Tree,” Proceedings of the 2006 IEEE International Conference on Robotics and Automation, vol. pp. 895–900\(,\) Orlando, Florida - May 2006.
Chenyang Xu; Prince, J.L., “Snakes, shapes, and gradient vector flow,” IEEE Transactions on Image Processing, vol. 7, no. 3, pp. 359–369, Mar 1998.
Thrun, S., Burgard, W., & Fox, D. (2005). Probabilistic robotics. MIT press.
Khelifa Baizid, PhD thesis (2011) “Multi-robots Tele-operation Platform: Design and Experiments” Italian Institute of Technology & University of Genova, Italy.
Acknowledgments
This research received funding from the European Community’s 7th Framework Programme under grant agreement n. 287617 (IP project ARCAS—Aerial Robotics Cooperative Assembly System).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Baizid, K., Chellali, R., Luza, R., Vitezslav, B., Arrichiello, F. (2016). RRS: Rapidly-Exploring Random Snakes a New Method for Mobile Robot Path Planning. In: Menegatti, E., Michael, N., Berns, K., Yamaguchi, H. (eds) Intelligent Autonomous Systems 13. Advances in Intelligent Systems and Computing, vol 302. Springer, Cham. https://doi.org/10.1007/978-3-319-08338-4_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-08338-4_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08337-7
Online ISBN: 978-3-319-08338-4
eBook Packages: EngineeringEngineering (R0)