Path planning algorithm design using particle swarms optimization and artificial potential fields

Abstract One of the most important challenges in an autonomous and robotics system is the path planning in which the system finds the optimal path from start point to goal point. The traditional path planning algorithms may have large memory requirements which scale with the size and resolution of the configuration space. To address these challenges, this paper introduces a novel path planning algorithm that combines Particle Swarm Optimization and Artificial Potential Field in the form of a path planning algorithm for mobile robots. The biological and physical concepts from Particle Swarm Optimization and Artificial Potential Field algorithms are combined to yield an algorithm which minimizes instances of getting stuck in local minima and generates a smooth but feasible path. The developed method requires memory which scales only with the number of particles and the time taken to reach the goal. This results in a memory‐efficient solution that generates smooth and feasible paths for mobile robots navigating in a 2D space.