Novel Ant Colony Optimization algorithm with Path Crossover and heterogeneous ants for path planning
- 1 January 2010
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
In this paper, a novel ACO algorithm is proposed to solve the global path planning problems, called Heterogeneous ACO (HACO) algorithm. We study to improve the performance and to optimize the algorithm for the global path panning of the mobile robot. The HACO algorithm differs from the Conventional ACO (CACO) algorithm for the path planning in three respects. We modify the Transition Probability Function (TPF) and the Pheromone Update Rule (PUR). In the PUR, we newly introduced the Path Crossover (PC). We also propose the first introduction of the heterogeneous ants in the ACO algorithm. In the simulation, we apply the proposed HACO algorithm to general path planning problems. At the last, we compare the performance with the CACO algorithm.Keywords
This publication has 6 references indexed in Scilit:
- Robot path planning by integrating the artificial potential field approach with simulated annealingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fast path planning using modified A* methodPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Evolutionary programming-based fuzzy logic path planner and follower for mobile robotsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Space Discretization for Efficient Human NavigationComputer Graphics Forum, 1998
- Ant system: optimization by a colony of cooperating agentsIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 1996
- Neural Network Dynamics for Path Planning and Obstacle AvoidanceNeural Networks, 1995