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...
Saved in:
Main Authors: | XIA, Wenwen, LI, Yuchen, GUO, Wentian, LI, Shenghong |
---|---|
格式: | text |
語言: | English |
出版: |
Institutional Knowledge at Singapore Management University
2022
|
主題: | |
在線閱讀: | 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 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Singapore Management University |
語言: | English |
相似書籍
-
Effective indexing for approximate constrained shortest path queries on large road networks
由: Wang, Sibo, et al.
出版: (2017) -
Multicast routing in WDM networks
由: LAHLOU KITANE DRISS
出版: (2010) -
Shortest Path Computation on Air Indexes
由: KELLARIS, Georgios, et al.
出版: (2010) -
Shortest Path Computation with No Information Leakage
由: MOURATIDIS, Kyriakos, et al.
出版: (2012) -
CMSTR: a constrained minimum spanning tree based routing protocol for wireless sensor networks
由: Lin, Deyu, et al.
出版: (2023)