Path Planning for Mobile Robots Based on Improved RRT Algorithm

摘要

Aiming at the shortcomings of the basic RRT algorithm, such as the random search ability is relatively strong, and the calculation result is usually not the shortest path, etc., an improved RRT path optimization algorithm is proposed, which uses the ant colony algorithm to obtain the basic RRT algorithm. The path is iterated and optimized, and eventually converges to a shortest path, improving the efficiency of planning the shortest path in advance, and conducting in-depth research on this algorithm. A large number of simulation results show that the improved algorithm has certain feasibility and effectiveness. In multiple iterations, it can eventually converge to a path with a better distance.