Repairing Compressed Path Databases on Maps with Dynamic Changes

Single-agent pathfinding on grid maps can exploit online compiled knowledge produced offline and saved as a Compressed Path Database (CPD). Such a knowledge is distilled by performing repeated searches in a graph, where each node corresponds to a distinct grid cell, typically by algorithms such as Dijkstra

Authors

• Marco Verzeletti
• Adi Botea
• Marina Zanella

Keywords

No keywords are indexed for this paper.