Research on Robot Path Planning Based on Simulated Annealing Algorithm

Abstract

Taking the path planning of inspection robots as the research object, a shortest path planning method based on simulated annealing algorithm was proposed. By analyzing the conditions of the shortest path generation, the mathematical solution model of the problem was established, and the global search strategy was formulated. Finally, the shortest path of the robot was solved through MATLAB software programming. The correctness and effectiveness of the algorithm are verified by a large number of examples. In addition, in view of the low efficiency of the traditional simulated annealing algorithm to solve the large-scale shortest path problem, the output result is unstable, and the path is easy to cross, a new solution is constructed in the form of random coordinate exchange. The results show that the shortest path output of this method not only has less crossover, but also the operation efficiency is obviously improved, and the result is more stable.