Optimal and Efficient Path Planning for Partially-Known Environments
|Links:||[pdf] 8 pages|
This article is about the D* algorithm. D* is short for dynamic A*, and is designed to handle the problem where path costs change as you traverse the path.
|Date created:||0000-00-00 00:00:00|
|Date evaluated:||0000-00-00 00:00:00|
|Categories:||Artificial Intelligence/Path finding/A* and its derivatives|