How do the state-of-the-art pathfinding algorithms for changing graphs (D*, D*-Lite, LPA*, etc) differ?A lot of pathfinding algorithms have been developed in recent years which can calculate the best path in response to graph changes much faster than A* - what are they, and how do they differ? Are they for different situations, or do some obsolete others? These are the ones I've been able to find so far: D* (1994) Focused D* (1995) DynamicSWSF-FP (1996) LPA (1997) LPA*/Incremental A* (2001) D* Lite
