PACE: a PAth-CEntric paradigm for stochastic path finding

B Yang, J Dai, C Guo, CS Jensen, J Hu - The VLDB Journal, 2018 - Springer
With the growing volumes of vehicle trajectory data, it becomes increasingly possible to
capture time-varying and uncertain travel costs, eg, travel time, in a road network. The …

Efficient stochastic routing in path-centric uncertain road networks

C Guo, R Xu, B Yang, Y Yuan, T Kieu, Y Zhao… - Proceedings of the …, 2024 - dl.acm.org
The availability of massive vehicle trajectory data enables the modeling of road-network
constrained movement as travel-cost distributions rather than just single-valued costs …

GP3: Gaussian process path planning for reliable shortest path in transportation networks

H Guo, X Hou, Z Cao, J Zhang - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
This paper investigates the reliable shortest path (RSP) problem in Gaussian process (GP)
regulated transportation networks. Specifically, the RSP problem that we are targeting at is …

DRL router: Distributional reinforcement learning-based router for reliable shortest path problems

H Guo, W Sheng, C Gao, Y ** - IEEE Intelligent Transportation …, 2023 - ieeexplore.ieee.org
This article studies reliable shortest path (RSP) problems in stochastic transportation
networks. The term reliability in the RSP literature has many definitions, eg, 1) maximal …

Stochastic on-time arrival problem in transit networks

Y Liu, S Blandin, S Samaranayake - Transportation Research Part B …, 2019 - Elsevier
This article considers the stochastic on-time arrival problem in transit networks where both
the travel time and the waiting time for transit services are stochastic. A specific challenge of …

Tractable pathfinding for the stochastic on-time arrival problem

M Niknami, S Samaranayake - International Symposium on Experimental …, 2016 - Springer
We present a new and more efficient technique for computing the route that maximizes the
probability of on-time arrival in stochastic networks, also known as the path-based stochastic …

Efficient Stochastic Routing in Path-Centric Uncertain Road Networks--Extended Version

C Guo, R Xu, B Yang, Y Yuan, T Kieu, Y Zhao… - arxiv preprint arxiv …, 2024 - arxiv.org
The availability of massive vehicle trajectory data enables the modeling of road-network
constrained movement as travel-cost distributions rather than just single-valued costs …

SEGAC: Sample efficient generalized actor critic for the stochastic on-time arrival problem

H Guo, Z He, W Sheng, Z Cao, Y Zhou… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
This paper studies the stochastic on-time arrival (SOTA) problem in transportation networks
and introduces a novel reinforcement learning-based algorithm, namely sample efficient …

Robust routing, its price, and the tradeoff between routing robustness and travel time reliability in road networks

F Manseur, N Farhi, CN Van Phu, H Haj-Salem… - European Journal of …, 2020 - Elsevier
We propose in this article an adaptive algorithm for optimal and robust guidance for the
users of the road networks. The algorithm is based on the Stochastic On Time Arrival (SOTA) …

Algorithms for non-linear and stochastic resource constrained shortest path

A Parmentier - Mathematical Methods of Operations Research, 2019 - Springer
Resource constrained shortest path problems are usually solved thanks to a smart
enumeration of all the non-dominated paths. Recent improvements of these enumeration …