The road to Navigation
Global path planning algorithm
Dijkstra
What is Dijkstra’s Algorithm?
Dijkstra’s algorithm is fundamental in robotics, especially for path planning, where robots need to find the shortest path from one point to another.
Dijkstra’s algorithm finds the shortest path between nodes in a graph. In robotics, nodes represent positions, and edges (connections between nodes) represent possible paths with associated costs (distances, time, or effort).