Deep Neural Network Enhanced Sampling-Based Path Planning in 3D Space
- 2 November 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 19 (4) , 3434-3443
Abstract
Robot path planning in 3D space is a challenging problem for its complex configuration. Sampling-based algorithms have gained great success in solving path planning problems in 3D space, but the quality of the initial path is not guaranteed and the convergence to the optimal solution is slow. To address these problems, in this article, we present a novel sampling-based path planning framework enhanced by the deep neural network (DNN) with applications to 3D space. In the proposed framework, we first train the DNN with a number of successful path planning cases in 3D space. Then the DNN is utilized to predict the promising region where the feasible path probably exists for a given path planning problem. This predicted promising region serves as a nonuniform sampling heuristic to bias the sampling process of the path planner. In this way, the path planner can focus on the promising region in the exploration and exploitation process so that the path planning speed gets accelerated. We conduct numerical simulations to evaluate the performance of the proposed algorithm and the results show that it can perform much better than conventional path planning algorithms. Furthermore, we also investigate the performance of different DNN architectures for path planning in 3D space. Note to Practitioners—In this work, we aim to provide an efficient learning-based method to accelerate the robot path planning process in 3D space. Conventional path planning algorithms need to perceive the environment first, and then implement a series of calculations such as collision checking and data storing to generate a feasible path. When facing complex and high-dimensional environments, they do not perform well. But the proposed neural network method in this article can predict the promising region where the feasible path exists for any given environment. This prediction result is used to guide the path planning process so that the algorithm performance can get significantly improved. Apart from sampling-based algorithms, the proposed neural network model can also be extended to other types of path planning algorithms.Keywords
Funding Information
- Shenzhen Key Laboratory of Robotics Perception and Intelligence (ZDSYS20200810171800001)
- Southern University of Science and Technology, Shenzhen, China
This publication has 31 references indexed in Scilit:
- U-Net: Convolutional Networks for Biomedical Image Segmentation2015
- Sampling-based A* algorithm for robot path-planningThe International Journal of Robotics Research, 2014
- Sampling-based algorithms for optimal motion planningThe International Journal of Robotics Research, 2011
- Quantitative Analysis of Nearest-Neighbors Search in High-Dimensional Sampling-Based Motion Planning2008
- Anytime, Dynamic Planning in High-dimensional Search SpacesProceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (cat. No.01ch37164), 2007
- Randomized Kinodynamic PlanningThe International Journal of Robotics Research, 2001
- Optimal and Efficient Path Planning for Partially Known Environments1997
- Probabilistic roadmaps for path planning in high-dimensional configuration spacesIEEE Transactions on Robotics and Automation, 1996
- Real-Time Obstacle Avoidance for Manipulators and Mobile RobotsThe International Journal of Robotics Research, 1986
- A note on two problems in connexion with graphsNumerische Mathematik, 1959