GVP-RRT: a grid based variable probability Rapidly-exploring Random Tree algorithm for AGV path planning

In response to the issues of low solution efficiency, poor path planning quality, and limited search completeness in narrow passage environments associated with Rapidly-exploring Random Tree (RRT), this paper proposes a Grid-based Variable Probability Rapidly-exploring Random Tree algorithm (GVP-RRT) for narrow passages. The algorithm introduced in this paper preprocesses the map through gridization to extract features of different path regions. Subsequently, it employs random growth with variable probability density based on the features of path regions using various strategies based on grid, probability, and guidance to enhance the probability of growth in narrow passages, thereby improving the completeness of the algorithm. Finally, the planned route is subjected to path re-optimization based on the triangle inequality principle. The simulation results demonstrate that the planning success rate of GVP-RRT in complex narrow channels is increased by 11.5–69.5% compared with other comparative algorithms, the average planning time is reduced by more than 50%, and the GVP-RRT has a shorter average planning path length.