A novel heterogeneous feature ant colony optimization and its application on robot path planning

Robot path planning is a complicated problem which needs to balance many factors. In pathfinding, the robot has to find the shortest path to the destination and avoid the obstacles. Ant colony optimization is a heuristic algorithm which has many excellent features in pathfinding. This paper proposed a heterogeneous feature ant colony optimization (HFACO) algorithm to solve the robot path planning problem. In the proposed method, two kinds of ants with different features are designed to influence the convergence rate of the algorithm by controlling the number of them. We also applied some other novel strategies that enhance the solving quality and the performance. The experiment results show that HFACO can find a better path in a shorter period of time compared to the classical ACO algorithms.

[1]  Sahar Trigui,et al.  SmartPATH: An Efficient Hybrid ACO-GA Algorithm for Solving the Global Path Planning Problem of Mobile Robots , 2014 .

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

[3]  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.

[4]  Oscar Castillo,et al.  Path planning for autonomous mobile robot navigation with ant colony optimization and fuzzy cost function evaluation , 2009, Appl. Soft Comput..

[5]  Hongyan Li,et al.  Study of Ant colony optimization algorithm in snake-like robot path planning , 2014 .

[6]  Sahar Trigui,et al.  smartPATH: A hybrid ACO-GA algorithm for robot path planning , 2012, 2012 IEEE Congress on Evolutionary Computation.

[7]  Hartmut Schmeck,et al.  Multi Colony Ant Algorithms , 2002, J. Heuristics.

[8]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[9]  Alma Y. Alanis,et al.  Smooth global and local path planning for mobile robot using particle swarm optimization, radial basis functions, splines and Bézier curves , 2014, 2014 IEEE Congress on Evolutionary Computation (CEC).

[10]  Tom Holvoet,et al.  Ant Colony Optimization Applied to Route Planning Using Link Travel Time Predictions , 2011, 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum.

[11]  P. Raja,et al.  Optimal path planning of mobile robots: A review , 2012 .

[12]  Sahar Trigui,et al.  On the Adequacy of Tabu Search for Global Robot Path Planning Problem in Grid Environments , 2014, ANT/SEIT.

[13]  Chi-Tsun Cheng,et al.  A 2-Dimensional ACO-Based Path Planner for Off-Line Robot Path Planning , 2013, 2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery.

[14]  Xinying Xu,et al.  Immune ant colony optimization network algorithm for multi-robot path planning , 2014, 2014 IEEE 5th International Conference on Software Engineering and Service Science.

[15]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[16]  Yue Guo,et al.  Research on the mobile robots intelligent path planning based on ant colony algorithm application in manufacturing logistics , 2014, FOCS 2014.

[17]  Guo Yue,et al.  RESEARCH ON THE MOBILE ROBOTS INTELLIGENT PATH PLANNING BASED ON ANT COLONY ALGORITHM APPLICATION IN MANUFACTURING LOGISTICS , 2014, FOCS 2014.

[18]  Jie Chen,et al.  Optimal Contraction Theorem for Exploration–Exploitation Tradeoff in Search and Optimization , 2009, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.