Research on path planning based on the Dijkstra algorithm and segmented path planning approach

With the development of robot automation, path planning, and obstacle avoidance have emerged as critical areas of research, raising significant attention. While Dijkstra's algorithm remains a robust and widely used solution for path planning, it exhibits limitations in managing complex and dynamic environments. This paper proposed an enhanced path-planning method that combines the Dijkstra algorithm with a segmented path-planning approach to improve adaptability and efficiency in dynamic environments. By modeling the environment using a grid map, the proposed method optimizes the path-planning process by segmenting the path and integrating intermediate waypoints. This approach effectively addresses the limitations of the conventional Dijkstra algorithm, particularly in scenarios requiring rapid re-planning due to obstacles or environmental changes. The final path is displayed in the results, which effectively combine segmented path planning between two points using the algorithm. It demonstrates that this method offers a more practical and flexible solution for autonomous navigation systems.