D* Lite path planning algorithm
Incremental heuristic search algorithm that efficiently replans when the graph changes (e.g., new obstacles detected).