This paper presents a method for robot path planning based on ant colony optimization algorithm, in order to resolve the weakness of ant colony algorithm such as slow convergence rate and easy to fall into local optimum and traps. This method uses anti-potential field to make the robot escape from them smoothly, and at the end of each cycle, uses the way of judge first and then hybridization to optimize the algorithm. Finally, the simulation results show that the performance of the algorithm has been improved, and proved that the optimization algorithm is valid and feasible.
A Heuristic Operator-Based Quantum Ant Colony Optimization Algorithm for Robot Path Planning
