Dynamic Informed Bias RRT*-Connect: Improving Heuristic Guidance by Dynamic Informed Bias Using Hybrid Dual Trees Search
Open Access
- 18 July 2024
- journal article
- research article
- Published by Springer Nature in Journal of Intelligent & Robotic Systems
- Vol. 110 (3) , 1-13
Abstract
The RRT*-Connect algorithm enhances efficiency through dual tree bias growth, yet this bias can be inherently blind, potentially affecting the algorithm’s heuristic performance. In contrast, the Informed RRT* algorithm narrows the planning problem’s scope by leveraging an informed region, thereby improving convergence efficiency towards optimal solutions. However, this approach relies on the prior establishment of feasible paths. Combining these two algorithms can address the challenges posed by Informed RRT while also accelerating convergence towards optimality, albeit without resolving the issue of blind bias in dual trees.In this paper, we proposed a novel algorithm: Dynamic Informed Bias RRT*-Connect. This algorithm, grounded in potential and explicit informed bias sampling, introduces a dynamical bias points set that guides dual tree growth with precision objectives. Additionally, we enhance the evaluation framework for algorithmic heuristics by introducing two innovative metrics that effectively capture the algorithm’s characteristics. The improvements observed in traditional indicators demonstrate that the proposed algorithm exhibits greater heuristic compared to RRT*-Connect and Informed RRT*-Connect. These findings also suggest the viability of the new metrics introduced in our evaluation framework.Keywords
Funding Information
- the National Key Research and Development Plan Program (No. 2023YFC2907400)
- Fundamental Research Funds for Central Universities of the Central South University (FRF-IDRY-21-025)
- Natural Science Foundation of China (51804019)
- Youth Core Individuals Project of Beijing (2017000020124G022)
This publication has 28 references indexed in Scilit:
- Route planning of mobile robot based on improved RRT star and TEB algorithmScientific Reports, 2024
- Repetitive process based indirect-type iterative learning control for batch processes with model uncertainty and input delayJournal of Process Control, 2023
- Q-learning based fault estimation and fault tolerant iterative learning control for MIMO systemsISA Transactions, 2023
- Path planning techniques for mobile robots: Review and prospectExpert Systems with Applications, 2023
- An efficient RRT-based motion planning algorithm for autonomous underwater vehicles under cylindrical sampling constraintsAutonomous Robots, 2023
- Improved Informed-RRT* Based Path Planning and Trajectory Optimization for Mobile RobotsInternational Journal of Precision Engineering and Manufacturing, 2023
- Research on Robot Motion Planning Based on RRT Algorithm with Nonholonomic ConstraintsNeural Processing Letters, 2021
- Finding a High-Quality Initial Solution for the RRTs Algorithms in 2D EnvironmentsRobotica, 2019
- Heuristic approaches in robot path planning: A surveyRobotics and Autonomous Systems, 2016
- Probabilistic roadmaps for path planning in high-dimensional configuration spacesIEEE Transactions on Robotics and Automation, 1996