A hybrid sampling-based RRT* path planning algorithm for autonomous mobile robot navigation

The path-planning algorithms for autonomous mobile robot navigation are crucial, often relying on sampling- based methods. RRT* is a robust, sampling-based path planning algorithm. The sampling process in RRT* plays a pivotal role, where uniform sampling can lead to slow convergence, while non-uniform sampling offers faster convergence but may struggle in complex environments due to its limited exploration. Thus, achieving a balance between exploitation and exploration is essential when selecting the sampling method for the RRT* path-planning algorithm. To address this issue, this research paper introduces Hybrid-RRT*, a path planning method that utilizes hybrid sampling. This unique approach generates samples using both non-uniform and uniform samplers. Hybrid-RRT* is evaluated against three baseline path planning algorithms-RRT*-N, Informed RRT*, and RRT*-across three different 384x384 2D simulation environments. Compared to these baseline methods, Hybrid-RRT* achieves superior results across all five performance metrics: convergence rate, success rate, number of nodes visited, path length, and planning time. According to the numerical results, the proposed algorithm achieves a faster average convergence rate that is 76.14% higher than RRT*, 24% higher than Informed RRT*, and 3.33% higher than RRT*-N. Moreover, it reduces node exploration by an average of 48.53% compared to RRT* and 40.83% compared to Informed RRT*. The simulation results demonstrate that the proposed Hybrid-RRT* algorithm effectively addresses the issue of slow convergence with uniform sampling and the challenge of limited exploration with non-uniform sampling methods.