PHAST: Hardware-Accelerated Shortest Path Trees

193 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A Survey of Autonomous Driving: Common Practices and Emerging Technologies (2019, methodology): “Graph search Dijkstra [250], A* [245], State lattice [251] Slow and jerky”
A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks (2011, background): “Fortunately, road networks have only about 150 levels [7].”
Gunrock: a high-performance graph processing library on the GPU (2015, background): “Efﬁciently implementing SSSP continues to be an interesting problem in the GPU world [3, 5, 6].”
Exact Routing in Large Road Networks Using Contraction Hierarchies (2012, methodology): “A fast algorithm to solve the one-to-all shortest path problem was presented by [Delling et al. 2010].”
Self-Driving Cars: A Survey (2019, methodology): “[DEL13b] can be combined with several techniques in order to accelerate them by exploiting parallelism of multiple core”
Route Planning in Transportation Networks (2015, methodology): “25 table lookup [65] 1 208 358.”