path-planning

1 free lesson tagged path-planning across Robotics. Each one is a short sequence of focused steps with narration and a five-question quiz at the end — take them in any order, no signup required.

Robotics

advanced

Graph Search: Dijkstra and A*

Discretise C-space into a grid, then search it intelligently. Understand Dijkstra's optimality guarantee, how A* accelerates it with admissible heuristics ($f=g+h$), why consistency matters, and where greedy search goes wrong.

8 steps·~12 min

Graph Search: Dijkstra and A*

Related topics