Robust adaptive strategies for the guidance of users in road networks
Farida Manseur, Nadir Farhi, Habib Haj-Salem, Jean-Patrick Lebacque

TL;DR
This paper introduces a robust, adaptive guidance algorithm for road networks that accounts for path failures and detours, enhancing reliability and user satisfaction in route planning.
Contribution
It extends existing stochastic-on-time-arrival algorithms to incorporate robustness against path failures and detours, considering user preferences for alternative routes.
Findings
Enhanced guidance strategies with increased robustness.
Improved reliability in route planning under failures.
User preferences for detours are effectively modeled.
Abstract
We present an algorithm for optimal guidance of users in road networks. It is a "stochastic-on-time-arrival (SOTA)"-like algorithm which calculates optimal guidance strategies with reliable paths, for road network origin-destination pairs. Our contribution consists here in extending an existing SOTA algorithm, in order to include robustness of the guidance strategy, towards path failures. The idea of SOTA algorithms is to calculate the maximum probability of reaching a destination node, starting from any node of a road network, and given a time budget. This calculus gives the optimal path for every origin-destination pair of nodes in the network, with an associated optimal adaptive guidance strategy. We propose here an extension of this approach in order to take into account the existence and the performance of alternative detours of the selected paths, in the calculus of the guidance…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
