A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
Repairing Compressed Path Databases on Maps with Dynamic Changes
Symposium on Combinatorial Search
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's. All-pairs shortest paths (APSPs) are computed, and the first move along a shortest path is persistently stored in the CPD. This way, an optimal move can efficiently be retrieved for anydblp:conf/socs/VerzelettiBZ19 fatcat:smbybdppkrhopnxa5xs372ahka