A review of robot path planning algorithms

Abstract

Path planning is an significant research aspect of multi-robot collaboration, which refers to the planning of a suitable path from the starting point to the target point of multiple robots under the constraint conditions. Path planning algorithms are divided into classical algorithms and heuristic algorithms, and the principles, advantages and disadvantages, research progress and so on of each algorithm are introduced. Finally, the existing research is summarized and prospected, which provides a reference for future research on robot path planning.