Efficient navigation for constrained shortest path with adaptive expansion control

In many route planning applications, finding constrained shortest paths (CSP) is an important and fundamental problem. CSP aims to find the shortest path between two nodes on a graph while satisfying a path constraint. Solving CSPs requires a large search space and is prohibitively slow on large gra...

Full description

Saved in:
Bibliographic Details
Main Authors: XIA, Wenwen, LI, Yuchen, GUO, Wentian, LI, Shenghong
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2022
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/7782
https://ink.library.smu.edu.sg/context/sis_research/article/8785/viewcontent/EfficientNavi_CSP_av.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-8785
record_format dspace
spelling sg-smu-ink.sis_research-87852023-04-04T03:20:54Z Efficient navigation for constrained shortest path with adaptive expansion control XIA, Wenwen LI, Yuchen GUO, Wentian LI, Shenghong In many route planning applications, finding constrained shortest paths (CSP) is an important and fundamental problem. CSP aims to find the shortest path between two nodes on a graph while satisfying a path constraint. Solving CSPs requires a large search space and is prohibitively slow on large graphs, even with the state-of-the-art parallel solution on GPUs. The reason lies in the lack of effective navigational information and pruning strategies in the search procedure. In this paper, we propose SPEC, a Shortest Path Enhanced approach for solving the exact CSP problem. Our design rationales of SPEC rely on the observation that the shortest path (SP) provides valuable information in the search procedure of CSP. Hence, we propose a label priority that distinguishes promising candidate paths based on SP. We further devise efficient pruning and teleporting strategies utilizing SP lengths and costs, which eliminates unfeasible paths at an early stage. Furthermore, we observe that the expansion number at each search iteration affects the overall performance significantly. Thus, we devise an adaptive controller based on reinforcement learning. We also show that SPEC works seamlessly with the parallel implementation. Extensive experimental results on 8 read-world graphs reveal that single thread SPEC achieves an order of magnitude speedup over the state-of-the-art GPU-based method. The parallel implementation boosts SPEC 3 to 5 times further. 2022-11-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/7782 info:doi/10.1109/ICDM54844.2022.00069 https://ink.library.smu.edu.sg/context/sis_research/article/8785/viewcontent/EfficientNavi_CSP_av.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Constrained shortest path shortest path Numerical Analysis and Scientific Computing Operations Research, Systems Engineering and Industrial Engineering
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Constrained shortest path
shortest path
Numerical Analysis and Scientific Computing
Operations Research, Systems Engineering and Industrial Engineering
spellingShingle Constrained shortest path
shortest path
Numerical Analysis and Scientific Computing
Operations Research, Systems Engineering and Industrial Engineering
XIA, Wenwen
LI, Yuchen
GUO, Wentian
LI, Shenghong
Efficient navigation for constrained shortest path with adaptive expansion control
description In many route planning applications, finding constrained shortest paths (CSP) is an important and fundamental problem. CSP aims to find the shortest path between two nodes on a graph while satisfying a path constraint. Solving CSPs requires a large search space and is prohibitively slow on large graphs, even with the state-of-the-art parallel solution on GPUs. The reason lies in the lack of effective navigational information and pruning strategies in the search procedure. In this paper, we propose SPEC, a Shortest Path Enhanced approach for solving the exact CSP problem. Our design rationales of SPEC rely on the observation that the shortest path (SP) provides valuable information in the search procedure of CSP. Hence, we propose a label priority that distinguishes promising candidate paths based on SP. We further devise efficient pruning and teleporting strategies utilizing SP lengths and costs, which eliminates unfeasible paths at an early stage. Furthermore, we observe that the expansion number at each search iteration affects the overall performance significantly. Thus, we devise an adaptive controller based on reinforcement learning. We also show that SPEC works seamlessly with the parallel implementation. Extensive experimental results on 8 read-world graphs reveal that single thread SPEC achieves an order of magnitude speedup over the state-of-the-art GPU-based method. The parallel implementation boosts SPEC 3 to 5 times further.
format text
author XIA, Wenwen
LI, Yuchen
GUO, Wentian
LI, Shenghong
author_facet XIA, Wenwen
LI, Yuchen
GUO, Wentian
LI, Shenghong
author_sort XIA, Wenwen
title Efficient navigation for constrained shortest path with adaptive expansion control
title_short Efficient navigation for constrained shortest path with adaptive expansion control
title_full Efficient navigation for constrained shortest path with adaptive expansion control
title_fullStr Efficient navigation for constrained shortest path with adaptive expansion control
title_full_unstemmed Efficient navigation for constrained shortest path with adaptive expansion control
title_sort efficient navigation for constrained shortest path with adaptive expansion control
publisher Institutional Knowledge at Singapore Management University
publishDate 2022
url https://ink.library.smu.edu.sg/sis_research/7782
https://ink.library.smu.edu.sg/context/sis_research/article/8785/viewcontent/EfficientNavi_CSP_av.pdf
_version_ 1770576496015966208