Path Planning Algorithms for Mobile Robots in Complex Environments: A MATLAB-Based Comparative Study
Abstract
This paper addresses the path planning problem for mobile robots operating in complex environments. We investigate classical algorithms including global planning approaches (A* algorithm, Dijkstra's algorithm) and local planning methods (Dynamic Window Approach, Artificial Potential Field). All algorithms are implemented and validated ...
Posted on Sun, 30 Aug 2026 16:30:29 +0000 by bitman