Parallel near-optimal pathfinding based on landmarks

Titelangaben

Reischl, Maximilian ; Knauer, Christian ; Guthe, Michael:
Parallel near-optimal pathfinding based on landmarks.
In: Computers & Graphics. Bd. 102 (2022) . - S. 1-8.
ISSN 0097-8493
DOI: https://doi.org/10.1016/j.cag.2021.11.007

Volltext

Link zum Volltext (externe URL):

Abstract

We present a new approach for path finding in weighted graphs using pre-computed minimal distance fields. By selecting the most promising minimal distance field at any given node and switching between them, our algorithm aims to find the shortest path possible. As we show, this approach scales excellently for various topologies, graph sizes and hardware specifications while maintaining a mean length error below 1 and reasonable memory consumption. By utilizing a simplified structure and keeping backtracking to a minimum, we are able to leverage the same approach on the massively parallel GPUs or any other shared memory parallel architecture, reducing the run time even further.