Path Planning Based on Simulated Annealing Ant Colony Algorithm

Abstract

In recent years, with the extensive application of the path planning technology, the development prospect of this technology is more and more broad, and the scientific research value of it is also more and more important. It is very necessary to apply it to the underground coal mine with complex terrain, and the algorithm is the core content of the research on path planning. We add simulated annealing algorithm into the process of ant colony algorithm formed simulated annealing ant colony algorithm in this paper, and apply it to the path planning, solve the local optimum problem caused by precocity in ant colony algorithm. For further ensure to find the optimal path, entropy increase strategy was used, that means using multiple update path to avoid algorithm premature, it's easier to find global optimal solution. Simulation result shows that the method presented in this paper obtains the optimization path and proves that the algorithm is efficient and reliable.