Path planning algorithm of maze based on Ant Colony Optimization

Searching optimal path is an important function of the maze question. For the shortage of the traditional algorithm to solve the maze problem, this paper at first analyzes the characteristic of Ant Colony Optimization(ACO) and designs the algorithm of dynamic path planning based on ACO. Secondly, after running the programs coded c#, this paper records the time complexity, space complexity and operating results of the algorithm based on ACO and the Dijastra algorithm. As the conclusion,this paper compares them qualitatively and quantitatively, and describes the next work in future.