Abstract: Pathfinding on grid maps is a cornerstone problem in robotics, autonomous navigation, and game development. Classical algorithms such as A*, Dijkstra’s, and Breadth-First Search (BFS) are ...

Abstract: This paper proposes an optimized Dijkstra algorithm for path planning in substation inspection robots. By modifying the data structure of unexpanded nodes to a priority queue and ...