Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-08T23:41:54.874Z Has data issue: false hasContentIssue false
  • English
  • Français

Finding a High-Quality Initial Solution for the RRTs Algorithms in 2D Environments

Published online by Cambridge University Press:  21 February 2019

Jiankun Wang Open the ORCID record for Jiankun Wang [Opens in a new window] ,
Wenzheng Chi ,
Mingjie Shao  and
Max Q.-H. Meng
Jiankun Wang
Affiliation:
Department of Electronic Engineering, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong SAR, China. E-mails: jkwang@ee.cuhk.edu.hk, mjshao@ee.cuhk.edu.hk
Wenzheng Chi
Affiliation:
Robotics and Microsystems Center, School of Mechanical and Electric Engineering, Soochow University, Suzhou, China. E-mail: wzchi@suda.edu.cn
Mingjie Shao
Affiliation:
Department of Electronic Engineering, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong SAR, China. E-mails: jkwang@ee.cuhk.edu.hk, mjshao@ee.cuhk.edu.hk
Max Q.-H. Meng*
Affiliation:
Department of Electronic Engineering, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong SAR, China. E-mails: jkwang@ee.cuhk.edu.hk, mjshao@ee.cuhk.edu.hk
*
*Corresponding author. E-mail: max.meng@cuhk.edu.hk
Rights & Permissions [Opens in a new window]

Summary

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this paper, we propose a bioinspired path planning algorithm for finding a high-quality initial solution based on the pipeline of the Rapidly exploring Random Tree (RRT) method by modifying the sampling process. The modification mainly includes controlling the sampling space and using the probabilistic sampling with the two-dimensional Gaussian mixture model. Inspired by the tropism of plants, we use a Gaussian mixture model to imitate the tree’s growth in nature. In a 2D environment, we can get an approximate moving point’s probabilistic distribution, and the initial path can be found much quickly guided by the probabilistic heuristic. At the same time, only a small number of nodes are generated, which can reduce the memory usage. As a meta-algorithm, it can be applicable to other RRT methods and the performance of underlying algorithm is improved dramatically. We also prove that the probabilistic completeness and the asymptotic optimality depend on the original algorithm (other RRTs). We demonstrate the application of our algorithm in different simulated 2D environments. On these scenarios, our algorithm outperforms the RRT and the RRT* methods on finding the initial solution. When embedded into post-processing algorithms like the Informed RRT*, it also promotes the convergence speed and saves the memory usage.

Keywords

Path planningMotion planningRoboticsMobile robot

Information

Type
Articles
Information
Robotica , Volume 37 , Issue 10 , October 2019 , pp. 1677 - 1694
Copyright
© Cambridge University Press 2019 

References

Willms, A. R. and Yang, S. X., “An efficient dynamic system for real-time robot-path planning,” IEEE Trans. Syst. Man Cybern. B Cybern. 36(4), 755–766 (2006).CrossRefGoogle ScholarPubMed
Yang, J., Qu, Z., Wang, J. and Conrad, K., “Comparison of optimal solutions to real-time path planning for a mobile vehicle,” IEEE Trans. Syst. Man Cybern. A Syst. Hum. 40(4), 721–731 (2010).CrossRefGoogle Scholar
Li, H., Yang, S. X. and Seto, M. L., “Neural-network-based path planning for a multirobot system with moving obstacles,” IEEE Trans. Syst. Man Cybern. C Appl. Rev. 39(4), 410–419 (2009).CrossRefGoogle Scholar
Khatib, O., “Real-time obstacle avoidance for manipulators and mobile robots,” Int. J. Rob. Res. 5(1), 90–98 (1986).CrossRefGoogle Scholar
Hart, P. E., Nilsson, N. J. and Raphael, B., “A formal basis for the heuristic determination of minimum cost paths,” IEEE Trans. Syst. Sci. Cybern. 4(2), 100–107 (1968).CrossRefGoogle Scholar
Stentz, A., “Optimal and Efficient Path Planning for Partially-known Environments,” Proceedings of the IEEE International Conference on Robotics and Automation, 1994, IEEE, San Diego, CA, USA (1994) pp. 3310–3317.CrossRefGoogle Scholar
LaValle, S. M. and Kuffner, J. J. Jr., “Randomized kinodynamic planning,” Int. J. Rob. Res. 20(5), 378–400 (2001).CrossRefGoogle Scholar
Kavraki, L. E., Svestka, P., Latombe, J.-C. and Overmars, M. H., “Probabilistic roadmaps for path planning in high-dimensional configuration spaces,” IEEE Trans. Robot. Autom. 12(4), 566–580 (1996).CrossRefGoogle Scholar
Urmson, C. and Simmons, R., “Approaches for Heuristically Biasing RRT Growth,” Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, 2003, IROS 2003, Las Vegas, NV, USA vol. 2, IEEE (2003) pp. 1178–1183.Google Scholar
Shkolnik, A., Walter, M. and Tedrake, R., “Reachability-guided Sampling for Planning Under Differential Constraints,” IEEE International Conference on Robotics and Automation, 2009, ICRA’09, IEEE, Kobe, Japan (2009) pp. 2859–2865.CrossRefGoogle Scholar
Wang, J., Li, X. and Meng, M. Q.-H., “An Improved RRT Algorithm Incorporating Obstacle Boundary Information,” Proceedings of the IEEE International Conference on Robotics and Biomimetics (ROBIO), IEEE, Qingdao, China (2016) pp. 625–630.Google Scholar
Kiesel, S., Burns, E. and Ruml, W., “Abstraction-guided Sampling for Motion Planning,” Proceedings of the Fifth Annual Symposium on Combinatorial Search, SoCS, Ontario, Canada (2012).Google Scholar
Wedge, N. A. and Branicky, M. S., “On Heavy-tailed Runtimes and Restarts in Rapidly-exploring Random Trees,” Twenty-Third AAAI Conference on Artificial Intelligence, Chicago, IL, USA (2008) pp. 127–133.Google Scholar
Gammell, J. D., Srinivasa, S. S. and Barfoot, T. D., “Informed RRT*: Optimal Sampling-based Path Planning Focused via Direct Sampling of an Admissible Ellipsoidal Heuristic,” Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, (IROS 2014), IEEE, Chicago, IL, USA (2014) pp. 2997–3004.Google Scholar
Geraerts, R. andOvermars, M. H., “Creating high-quality paths for motion planning,” Int. J. Rob. Res. 26(8), 845–863 (2007).CrossRefGoogle Scholar
Brunner, M., Brüggemann, B. and Schulz, D., “Hierarchical Rough Terrain Motion Planning Using an Optimal Sampling-based Method,” Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), IEEE, Karlsruhe, Germany (2013) pp. 5539–5544.Google Scholar
Palmieri, L., Koenig, S. and Arras, K. O., “RRT-based Nonholonomic Motion Planning Using Any-angle Path Biasing,” Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), IEEE, Stockholm, Sweden (2016) pp. 2775–2781.Google Scholar
Raveh, B., Enosh, A. and Halperin, D., “A little more, a lot better: Improving path quality by a path-merging algorithm,” IEEE Trans. Rob. 27(2), 365–371 (2011).CrossRefGoogle Scholar
Arslan, O. and Tsiotras, P., “Use of Relaxation Methods in Sampling-based Algorithms for Optimal Motion Planning,” IEEE International Conference on Robotics and Automation (ICRA), IEEE, Karlsruhe, Germany (2013) pp. 2421–2428.Google Scholar
Dorigo, M. and Gambardella, L. M., “Ant colony system: A cooperative learning approach to the traveling salesman problem,” IEEE Trans Evol Comput 1(1), 53–66 (1997).CrossRefGoogle Scholar
Grefenstette, J., Gopal, R., Rosmaita, B. and Van Gucht, D., “Genetic Algorithms for the Traveling Salesman Problem,” Proceedings of the first International Conference on Genetic Algorithms and their Applications Pittsburgh, PA, USA (1985) pp. 160–168.Google Scholar
Ferrante, E., Turgut, A. E., Huepe, C., Stranieri, A., Pinciroli, C. andDorigo, M., “Self-organized flocking with a mobile robot swarm: A novel motion control method,” Adapt. Behav. 20(6), 460–477 (2012).CrossRefGoogle Scholar
Güzel, M. S., Kara, M. and Beyazkılıç, M. S., “An adaptive framework for mobile robot navigation,” Adapt. Behav. 25(1), 30–39 (2017).CrossRefGoogle Scholar
Dean, T., Basye, K. and Shewchuk, J., “Reinforcement Learning for Planning and Control,” In: Machine Learning Methods for Planning, Minton, S. (ed.) (Elsevier, San Francisco, CA, USA, 1993) pp. 67–92.CrossRefGoogle Scholar
Kretzschmar, H., Spies, M., Sprunk, C. and Burgard, W., “Socially compliant mobile robot navigation via inverse reinforcement learning,” Int. J. Rob. Res. 35(11), 1289–1307 (2016).CrossRefGoogle Scholar
Karaman, S. and Frazzoli, E., “Sampling-based algorithms for optimal motion planning,” Int. J. Rob. Res. 30(7), 846–894 (2011).CrossRefGoogle Scholar
Janson, L., Schmerling, E., Clark, A. and Pavone, M., “Fast marching tree: A fast marching sampling-based method for optimal motion planning in many dimensions,” Int. J. Rob. Res. 34(7), 883–921 (2015).CrossRefGoogle ScholarPubMed
Li, Y., Littlefield, Z. and Bekris, K. E., “Sparse Methods for Efficient Asymptotically Optimal Kinodynamic Planning,” In: Algorithmic Foundations of Robotics XI Akin, H. L., Amato, N. M., Isler, V., van der Stappen, A. F. (eds.) (Springer, Istanbul, Turkey, 2015) pp. 263–282.CrossRefGoogle Scholar
Salzman, O. and Halperin, D., “Asymptotically near-optimal RRT for fast, high-quality motion planning,” IEEE Trans. Rob. 32(3), 473–483 (2016).CrossRefGoogle Scholar
Ferguson, D. and Stentz, A., “Anytime RRTs,” IEEE/RSJ International Conference on Intelligent Robots and Systems, IEEE, Beijing, China (2006) pp. 5369–5375.Google Scholar
Naderi, K., Rajamäki, J. and Hämäläinen, P., “RT-RRT*: A Real-time Path Planning Algorithm Based on RRT,” Proceedings of the 8th ACM SIGGRAPH Conference on Motion in Games, ACM, New York, NY, USA (2015), pp. 113–118.CrossRefGoogle Scholar
Kleinbort, M., Salzman, O. and Halperin, D., “Efficient High-quality Motion Planning by Fast All-pairs r-nearest-neighbors,” IEEE International Conference on Robotics and Automation (ICRA), IEEE, Seattle, WA, USA (2015) pp. 2985–2990.CrossRefGoogle Scholar
LaValle, S. M., Planning Algorithms (Cambridge University Press, New York, NY, USA, 2006).CrossRefGoogle Scholar
Bialkowski, J., Karaman, S., Otte, M. and Frazzoli, E., “Efficient Collision Checking in Sampling-based Motion Planning,” In: Algorithmic Foundations of Robotics X (Springer, Boston, MA, USA, 2013) pp. 365–380.CrossRefGoogle Scholar