Study and Application on Maze Path Planning Based on Improved Ant Colony Algorithm

摘要

Searching optimal path in the maze is an important function of the micromouse in order to find the optimization accurately and rapidly,the dynamic path planning model of the micromouse in the maze is constructed, and the adaptive method to update information on traditional ant colony algorithm convergence slow problem is improved through computer simulation and practical micromouse walking robot in the field experiments,the results show that under the complex conditions,the proposed algorithm can plan the global optimal path effectively.