Efficient navigation for constrained shortest path with adaptive expansion control

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:
Constrained shortest path
shortest path
Numerical Analysis and Scientific Computing
Operations Research, Systems Engineering and Industrial Engineering
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

Internet

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

Similar Items