Path Planning of Mobile Robot Based on Improved PRM Based on Cubic Spline

In view of the shortcomings of low search efficiency and many path turning points of Probabilistic Roadmaps (PRM), a bidirectional search PRM global path planning algorithm is proposed. The algorithm improves the search connection rules by using the positive and negative directions to search the path alternately, so that the connection of unnecessary nodes reduces, thereby speeding up the efficiency of path planning. Besides, the algorithm incorporates cubic spline interpolation. That will increase the smoothness of path planning and ensure that the mobile robot can realize the path planning task more smoothly and safely. The simulation results show that the improved algorithm can effectively improve the convergence speed and path smoothness of the algorithm. Finally, the improved algorithm is applied to the actual mobile robot navigation experiment. The experimental results have proven that the path planning strategy was able to a superior advantage over traditional PRM in path quality and computational time