Pathfinding Algorithms for Changing Graphs
The algorithms summarized at the end of the discussion:
- D* (1994)
- Focused D* (1995)
- DynamicSWSF-FP (1996)
- LPA (1997)
- LPA*/Incremental A* (2001)
- D* Lite (2002)
- SetA* (2002)
- HPA* (2004)
- Anytime D* (2005)
- PRA* (2005)
- Field D* (2007)
- Theta* (2007)
- HAA* (2008)
- GAA* (2008)
- LEARCH (2009)
- BDDD* (2009 – I cannot access this paper :|)
- Incremental Phi* (2009)
- GFRA* (2010)
- MTD*-Lite (2010)
- Tree-AA* (2011)
The increased interest in graph based information processing promises this will be an active area of research.
I first saw this in a tweet by GraphHopper.