Traversal Path Planning of Sweeping Robot Based on Memory Simulated Annealing Algorithm
In order to solve the path planning problem of sweeping robot,a traversal algorithm based on improved simulated annealing algorithm and ant colony algorithm is proposed.The memory simulated annealing algorithm is used to solve the optimal or-der of traversing the partition,and the ant colony algorithm is used to connect.The simulation results show that the path length of the central point of the sub-region planned by the improved algorithm is 8.87%shorter than that of the traditional simulated anneal-ing algorithm.The path traversal coverage of the cleaning robot can reach 100%,and the path traversal repetition rate can be re-duced to about 8%.Compared with the traditional simulated annealing algorithm,the improved simulated annealing algorithm adds new memory,makes it easier to jump out of the local optimum,improves the quality of understanding,and greatly improves the effi-ciency of the scanning robot.
国家科技期刊平台
NSTL
万方数据
