Path Planning for Service Robots

Abstract

Path Planning is an essential aspect of the navigation of mobile service robots. The problem of path planning includes low time efficiency, large memory cost, local optimum, and slow speed in finding the global optimum. This paper reviews three main path planning algorithms and their extensions for the service robots. The first one is Ant Colony Optimization (ACO). The second algorithm is Particle Swarm Optimization (PSO) and some hybrid PSO-related algorithms. The third one is a conventional algorithm named Rapidly Exploring Random Tree (RRT).