Comparing the Performance of Genetic Algorithm and Ant Colony Optimization Algorithm for Mobile Robot Path Planning in the Dynamic Environments with Different Complexities

In this paper, genetic algorithm and ant colony optimization algorithm are used for route moving robot in dynamic environments with various complexities. Both algorithms work with global routing and need a general map from environment. Since environments are dynamic and different paths have variable length, chromosome structure with variable length is employed. In this study the performance of both algorithms in the execution speed and the number of occurrences for obtaining the optimal path in various dynamic environments has been evaluated using MATLAB simulation methods. Obtained results from comparing the performance of these two algorithms by considering performance and adjusting the parameters and their advantages beside limitations, developed optimization algorithms for route moving robots.

[1]  Tiejun Li,et al.  The Ant Algorithm for Solving Robot Path Planning Problem , 2005, Third International Conference on Information Technology and Applications (ICITA'05).

[2]  S. Parasuraman,et al.  Improved Ant Colony Optimization for robot navigation , 2010, 7th International Symposium on Mechatronics and its Applications.

[3]  O Hachour,et al.  PATH PLANNING OF AUTONOMOUS MOBILE ROBOT , 2008 .

[4]  J. Basterrechea,et al.  Comparison of Different Heuristic Optimization Methods for Near-Field Antenna Measurements , 2007, IEEE Transactions on Antennas and Propagation.

[5]  Du Xin,et al.  Neural network and genetic algorithm based global path planning in a static environment , 2005 .

[6]  Yangsheng Xu,et al.  A generalized 3-D path planning method for robots using Genetic Algorithm with an adaptive evolution process , 2010, World Congress on Intelligent Control and Automation.

[7]  P. Raja,et al.  Path Planning for Mobile Robots in Dynamic Environments Using Particle Swarm Optimization , 2009, 2009 International Conference on Advances in Recent Technologies in Communication and Computing.

[8]  Soh Chin Yun,et al.  Improved genetic algorithms based optimum path planning for mobile robot , 2010, 2010 11th International Conference on Control Automation Robotics & Vision.

[9]  Arthur C. Sanderson,et al.  Planning multiple paths with evolutionary speciation , 2001, IEEE Trans. Evol. Comput..

[10]  Hakil Kim,et al.  Path planning and navigation for autonomous mobile robot , 2002, IEEE 2002 28th Annual Conference of the Industrial Electronics Society. IECON 02.

[11]  Maxim Likhachev,et al.  Search-based planning for manipulation with motion primitives , 2010, 2010 IEEE International Conference on Robotics and Automation.

[12]  N. Buniyamin,et al.  An Overview of Autonomous Mobile Robot Path Planning Algorithms , 2006, 2006 4th Student Conference on Research and Development.

[13]  Yanling Hao,et al.  Path Planning for Aircraft Based on MAKLINK Graph Theory and Multi Colony Ant Algorithm , 2009, 2009 International Joint Conference on Computational Sciences and Optimization.

[14]  Simon X. Yang,et al.  A knowledge based genetic algorithm for path planning of a mobile robot , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[15]  Michael Negnevitsky,et al.  Artificial Intelligence: A Guide to Intelligent Systems , 2001 .

[16]  Farbod Fahimi,et al.  Real-time obstacle avoidance for multiple mobile robots , 2009, Robotica.