国产欧美精品一区二区,中文字幕专区在线亚洲,国产精品美女网站在线观看,艾秋果冻传媒2021精品,在线免费一区二区,久久久久久青草大香综合精品,日韩美aaa特级毛片,欧美成人精品午夜免费影视

For handling the problems that traditional path planning method of transport robot is easy to get into local optimal solution and lacking in general adaptability to environment, this paper proposed an improved grid method to create a handling robot working environment model, and based on the improved greedy algorithm, and referenced to the idea of genetic algorithm. This article defines the annealing coefficient and the lattice coefficient and puts forward an improved simulated annealing algorithm which can solve the problem of local convergence of the improved greedy algorithm. Finally, through simulation and concrete physical experiment, it is proved that this algorithm is feasible and can adapt to different environment, which can effectively improve the quality of robot path planning.