Metaheuristic Algorithm for Robotic Path Planning

摘要

This paper presents a metaheuristic optimization algorithm for mobile robot path planning problem. A comparative study between particle swarm and ant colony optimization algorithm is conducted. The experimental study shows that the ant colony optimization algorithm outperforms over particle swarm optimization in terms of computational time.