A Survey on Path Planning Algorithms for Mobile Robots

The use of mobile robots is growing every day. Path planning algorithms are needed to allow the coordination of several robots, and make them travel with the least cost and without collisions. With this emerged the interest in studying some path planning algorithms, in order to better understand the operation of each one when applied in this type of robots. The objective of this paper is to present a state of the art survey of some algorithms of path planning for mobile robots. A brief introduction on mobile robots and trajectory planning algorithms is made. After, the basis of each algorithm is explained, their relative advantages and disadvantages are presented and are mentioned areas of application for each of them. This study was developed in order to implement some of these algorithms in the near future, with the objective to find out their relative advantages and disadvantages, and in which situations their implementation is more adequate.