Two-Dimension Path Planning Method Based on Improved Ant Colony Algorithm

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.

[1]  Kimon P. Valavanis,et al.  Evolutionary algorithm based offline/online path planner for UAV navigation , 2003, IEEE Trans. Syst. Man Cybern. Part B.

[2]  B. Bullnheimer,et al.  A NEW RANK BASED VERSION OF THE ANT SYSTEM: A COMPUTATIONAL STUDY , 1997 .

[3]  Libor Preucil,et al.  Robot Path Planning using Particle Swarm Optimization of Ferguson Splines , 2006, 2006 IEEE Conference on Emerging Technologies and Factory Automation.

[4]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[5]  Christoph Helmberg,et al.  The symmetric quadratic traveling salesman problem , 2013, Math. Program..

[6]  Chien-Hung Chen,et al.  Development of optimal path planning based on ant colony and wireless sensor network localization techniques for an autonomous mobile service robot , 2014, 2014 International Conference on Information Science, Electronics and Electrical Engineering.

[7]  Mauricio G. C. Resende,et al.  A biased random-key genetic algorithm for the capacitated minimum spanning tree problem , 2015, Comput. Oper. Res..

[8]  Li Min.  Chaotic prediction of network traffic based on neural network optimized by ant colony optimization algorithm , 2012 .

[9]  Niu Xiao-mei,et al.  Simulation Research on Mobile Robot Path Planning Based on Ant Colony Optimization , 2011 .

[10]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[11]  Shuang Liu,et al.  A dynamic priority based path planning for cooperation of multiple mobile robots in formation forming , 2014 .

[12]  M. Sunwoo,et al.  Real-time path planning of autonomous vehicles for unstructured road navigation , 2015 .

[13]  Manish Mandloi,et al.  Congestion control based ant colony optimization algorithm for large MIMO detection , 2015, Expert Syst. Appl..

[14]  Liu Wei-jie.  A Improved Method of Robot’s Path Planning Based Visibilty Graph , 2009 .

[15]  Michael Schreckenberg,et al.  A dynamic route guidance system based on real traffic data , 2001, Eur. J. Oper. Res..

[16]  Xiong Luo,et al.  Optimal path planning for mobile robots based on intensified ant colony optimization algorithm , 2003, IEEE International Conference on Robotics, Intelligent Systems and Signal Processing, 2003. Proceedings. 2003.