An Overview of Collision-Free Path Planning Techniques for Industrial Autonomous Robots

Abstract

One of the most important research questions in industrial and humanoid robotics in dynamic situations is collision and occlusion-free path planning (COFPP). The effectiveness and efficiency of the path planning algorithms are assessed under a variety of restrictions, such as dynamic and static environments with various levels of complexity. This chapter carries out a comparative analysis of collision-free path planning in industrial robots. Discussion is held regarding the effectiveness of various collision-free path planning algorithms, including Dijkstra, A*, Probabilistic Road Map, RRT, and RRT*, as well as their benefits and drawbacks.