PATH OPTIMIZATION METHOD OF INDUSTRIAL ROBOT-BASED RESEARCH IN BOGIE APPEARANCE INSPECTION

To solve the problem of robot path planning in bogie appearance inspection, the real situation of large tasks is simulated. In this paper, greedy algorithm[1] is used to simulate artificial path selection. Aiming at the problem of poor global search ability and easy to fall into local optimal solution, simulated annealing algorithm and improved A* ant colony algorithm are proposed. To verify the applicability of the algorithm, these three algorithms are used for 100 path points and 50 path points. Experiments show that the simulated annealing algorithm has improved in terms of computing speed, and the improved A* ant colony algorithm has advantages in search accuracy and stability. The greater the number of tasks, the more obvious the advantages of the model, and the higher the proportion of path shortening.