Detours in Scope-Based Route Planning
Petr Hlin\v{e}n\'y, Ondrej Mori\v{s}

TL;DR
This paper enhances scope-based route planning to effectively handle road closures by proposing three detour admissibility variants, improving practical navigation in dynamic road network scenarios.
Contribution
It introduces three new detour admissibility variants to extend scope-based route planning for better handling of road closures and dynamic edge weights.
Findings
Enhanced route planning algorithms for detours
Three variants of detour admissibility proposed
Improved handling of road closures in navigation
Abstract
We study a dynamic scenario of the static route planning problem in road networks. Particularly, we put accent on the most practical dynamic case - increased edge weights (up to infinity). We show how to enhance the scope-based route planning approach presented at ESA'11 to intuitively by-pass closures by detours. Three variants of a detour "admissibility" are presented - from a simple one with straightforward implementation through its enhanced version to a full and very complex variant variant which always returns an optimal detour.
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.
Taxonomy
TopicsData Management and Algorithms · Robotic Path Planning Algorithms · Constraint Satisfaction and Optimization
