Hybrid Path Planning Algorithm for Autonomous Mobile Robots: A Comprehensive Review

Path planning is a complex task in robotics, requiring an efficient and adaptive algorithm to find the shortest path in a dynamic environment. The traditional path planning methods, such as graph-based algorithms, sampling-based algorithms, reaction-based algorithms, and optimization-based algorithms, have limitations in computational efficiency, real-time adaptability, and obstacle avoidance. To address these challenges, hybrid path planning algorithms combine the strengths of multiple techniques to enhance performance. This paper includes a comprehensive review of hybrid approaches based on graph-based algorithms, sampling-based algorithms, reaction-based algorithms, and optimization-based algorithms. Also, this article discusses the advantages and limitations, supported by a comparative evaluation of computational complexity, path optimization, and finding the shortest path in a dynamic environment. Finally, we propose an AI-driven adaptive path planning approach to solve the difficulties.