D* Lite

An incremental replanning algorithm for shortest-path computation that efficiently updates the path when the map changes (e.g., new obstacles detected). Unlike A* which replans from scratch, D* Lite reuses previous computation, making it suitable for real-time navigation in partially known environments where sensor updates continuously reveal new information.