A hybrid ACO-PSO technique for path planning

Abstract

Robotic path planning is an important topic in today's scenario. Robots have to choose their path from source to destination with minimum distance possible, within minimum time, and with minimum number of turns and moves possible. Metaheuristic is an approach that guides the search process. Meta stands for upper level and heuristic means to find. Metaheuristic search algorithms provide optimal solution. Metaheuristics are approximate and non-deterministic algorithms. These algorithms are not problem specific. To overcome this problem, hybrid approach of ACO-PSO is used. This approach is used to find optimal path for robot with avoiding the collision with obstacles encountered during its path. Simulation results of this hybrid approach provide collision free path and better results as compared to the traditional heuristic approach (ACO and PSO).