| 摘要 |
A system (10) is disclosed for determining a path in a network (A, B, C, D, E, F, G, H, I, O) that decreases the number of accesses to disk (16) needed during the pathfinding computation. The network (A, B, C, D, E, F, G, H, I, O) is divided into a set of tiles (270, 272, 274). Certain sub-paths are pre-computed and are grouped into webs. When finding a path, the system (10) will perform a pathfinding exploration within the tile (270, 272, 274) for the designated origin (450) as well as a pathfinding exploration within the tile (270, 272, 274) for the designated destination (452). A number of the webs will be used with the two explorations to determine a path from the designated origin (450) to the designated destination.
|
