Path Planning Algorithms of the Mobile Robots Control

The purpose of this paper is to provide a complete analysis and comparison of the most used algorithms to plan the trajectories of mobile robots. By examining the principles, functions, and applications of these algorithms, it is intended to see their particular advantages and limitations. Each algorithm is analyzed in detail, including basic principles, mathematical fundamentals, and applications in the real world. Further, a comparative analysis has been developed, assessing algorithms based on various criteria, such as performance, applicability, limitations, computational requirements, and suitability. By examining these factors, we aim to provide a thorough understanding of the advantages and disadvantages of each algorithm. There are a wide range of algorithms and models available for controlling mobile robots. Depending on the specific application needs, various algorithms such as A*, RERT, Pure Pursuit, MPC, etc., as well as mathematical and Artificial Intelligence-based models for robot control, object tracking, obstacle avoidance, and many more can be used.