[HTML][HTML] Path planning algorithms in the autonomous driving system: A comprehensive review

M Reda, A Onsy, AY Haikal, A Ghanbari - Robotics and Autonomous …, 2024 - Elsevier
This comprehensive review focuses on the Autonomous Driving System (ADS), which aims
to reduce human errors that are the reason for about 95% of car accidents. The ADS …

A Survey of Autonomous Driving: Common Practices and Emerging Technologies

E Yurtsever, J Lambert, A Carballo, K Takeda - IEEE access, 2020 - ieeexplore.ieee.org
Automated driving systems (ADSs) promise a safe, comfortable and efficient driving
experience. However, fatalities involving vehicles equipped with ADSs are on the rise. The …

Self-driving cars: A survey

C Badue, R Guidolini, RV Carneiro, P Azevedo… - Expert systems with …, 2021 - Elsevier
We survey research on self-driving cars published in the literature focusing on autonomous
cars developed since the DARPA challenges, which are equipped with an autonomy system …

Route planning in transportation networks

H Bast, D Delling, A Goldberg… - … : Selected results and …, 2016 - Springer
We survey recent advances in algorithms for route planning in transportation networks. For
road networks, we show that one can compute driving directions in milliseconds or less even …

Gunrock: A high-performance graph processing library on the GPU

Y Wang, A Davidson, Y Pan, Y Wu, A Riffel… - Proceedings of the 21st …, 2016 - dl.acm.org
For large-scale graph analytics on the GPU, the irregularity of data access/control flow and
the complexity of programming GPUs have been two significant challenges for develo** a …

Exact routing in large road networks using contraction hierarchies

R Geisberger, P Sanders, D Schultes… - Transportation …, 2012 - pubsonline.informs.org
Contraction hierarchies are a simple approach for fast routing in road networks. Our
algorithm calculates exact shortest paths and handles road networks of whole continents …

A hub-based labeling algorithm for shortest paths in road networks

I Abraham, D Delling, AV Goldberg… - … Symposium, SEA 2011 …, 2011 - Springer
Abstract Abraham et al.[SODA 2010] have recently presented a theoretical analysis of
several practical point-to-point shortest path algorithms based on modeling road networks …

Shortest-path queries in static networks

C Sommer - ACM Computing Surveys (CSUR), 2014 - dl.acm.org
We consider the point-to-point (approximate) shortest-path query problem, which is the
following generalization of the classical single-source (SSSP) and all-pairs shortest-path …

Work-efficient parallel GPU methods for single-source shortest paths

A Davidson, S Baxter, M Garland… - 2014 IEEE 28th …, 2014 - ieeexplore.ieee.org
Finding the shortest paths from a single source to all other vertices is a fundamental method
used in a variety of higher-level graph algorithms. We present three parallel friendly and …

Gunrock: GPU graph analytics

Y Wang, Y Pan, A Davidson, Y Wu, C Yang… - ACM Transactions on …, 2017 - dl.acm.org
For large-scale graph analytics on the GPU, the irregularity of data access and control flow,
and the complexity of programming GPUs, have presented two significant challenges to …