graph-search

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.