Author(s)

Rong Wang^*, Hong Jiang

Southwest University of Science and Technology, Mianyang, China.

Nowadays, path planning has become an important field of research focus. Considering that the ant colony algorithm has numerous advantages such as the distributed computing and the characteristics of heuristic search, how to combine the algorithm with two-dimension path planning effectively is much important. In this paper, an improved ant colony algorithm is used in resolving this path planning problem, which can improve convergence rate by using this improved algorithm. MAKLINK graph is adopted to establish the two-dimensional space model at first, after that the Dijkstra algorithm is selected as the initial planning algorithm to get an initial path, immediately following, optimizing the select parameters relating on the ant colony algorithm and its improved algorithm. After making the initial parameter, the authors plan out an optimal path from start to finish in a known environment through ant colony algorithm and its improved algorithm. Finally, Matlab is applied as software tool for coding and simulation validation. Numerical experiments show that the improved algorithm can play a more appropriate path planning than the origin algorithm in the completely observable.

Path Planning, Dijkstra, Improved Ant Colony Algorithm

Wang, R. and Jiang, H. (2015) Two-Dimension Path Planning Method Based on Improved Ant Colony Algorithm. Advances in Pure Mathematics, 5, 571-578. doi: 10.4236/apm.2015.59053.