Enhance Connectivity of Promising Regions for Sampling-Based Path Planning
- 20 July 2022
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 20 (3) , 1997-2010
Abstract
Sampling-based path planning algorithms usually implement uniform sampling methods to search the state space. However, uniform sampling may lead to unnecessary exploration in many scenarios, such as the environment with a few dead ends. Our previous work proposes to use the promising region to guide the sampling process to address the issue. However, the predicted promising regions are often disconnected, which means they cannot connect the start and goal states, resulting in a lack of probabilistic completeness. This work focuses on enhancing the connectivity of predicted promising regions. Our proposed method regresses the connectivity probability of the edges in the x and y directions. In addition, it calculates the weight of the promising edges in loss to guide the neural network to pay more attention to the connectivity of the promising regions. We conduct a series of simulation experiments, and the results show that the connectivity of promising regions improves significantly. Furthermore, we analyze the effect of connectivity on sampling-based path planning algorithms and conclude that connectivity plays an essential role in maintaining algorithm performance. Note to Practitioners—This work is derived from the promising region prediction for sampling-based path planning. The sampling-based path planning methods have been widely used in robotics due to their efficiency. To further improve the efficiency of these algorithms, sampling in the promising region predicted by a neural network is introduced into the sampling procedure. However, the connectivity of the promising region has yet to be considered, and it will affect the performance of the algorithms in several aspects. To demonstrate this problem, we compare the performance of the neural heuristic algorithms under different connectivity statuses in this paper. Furthermore, to enhance the connectivity of the predicted promising region, the novel prediction output and loss function are proposed. The simulation results show improvements in the algorithms after utilizing our method.Keywords
All Related Versions
Funding Information
- National Key Research and Development Program of China (2019YFB1312400)
- Hong Kong Research Grants Council (RGC) General Research Fund (14200618)
- National Natural Science Foundation of China (62103181)
This publication has 28 references indexed in Scilit:
- Fast marching tree: A fast marching sampling-based method for optimal motion planning in many dimensionsThe International Journal of Robotics Research, 2015
- Batch Informed Trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs2015
- Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic2014
- Focussed processing of MDPs for path planning2005
- Lifelong Planning A∗Artificial Intelligence, 2004
- Randomized Kinodynamic PlanningThe International Journal of Robotics Research, 2001
- RRT-connect: An efficient approach to single-query path planning2000
- Probabilistic roadmaps for path planning in high-dimensional configuration spacesIEEE Transactions on Robotics and Automation, 1996
- Real-Time Obstacle Avoidance for Manipulators and Mobile Robots1986
- A note on two problems in connexion with graphsNumerische Mathematik, 1959