UM  > 科技學院  > 電腦及資訊科學系
Towards online shortest path computation
Hou U L.1; Zhao H.J.1; Yiu M.L.2; Li Y.1; Gong Z.1
2014
Source PublicationIEEE Transactions on Knowledge and Data Engineering
ISSN10414347
Volume26Issue:4Pages:1012
Abstract

The online shortest path problem aims at computing the shortest path based on live traffic circumstances. This is very important in modern car navigation systems as it helps drivers to make sensible decisions. To our best knowledge, there is no efficient system/solution that can offer affordable costs at both client and server sides for online shortest path computation. Unfortunately, the conventional client-server architecture scales poorly with the number of clients. A promising approach is to let the server collect live traffic information and then broadcast them over radio or wireless network. This approach has excellent scalability with the number of clients. Thus, we develop a new framework called live traffic index (LTI)which enables drivers to quickly and effectively collect the live traffic information on the broadcasting channel. An impressive result is that the driver can compute/update their shortest path result by receiving only a small fraction of the index. Our experimental study shows that LTI is robust to various parameters and it offers relatively short tune-in cost (at client side), fast query response time (at client side), small broadcast size (at server side), and light maintenance time (at server side)for online shortest path problem. © 1989-2012 IEEE.

KeywordAir Index Broadcasting Shortest Path
DOI10.1109/TKDE.2013.176
URLView the original
Indexed BySCI
Language英语
WOS Research AreaComputer Science ; Engineering
WOS SubjectComputer Science, Artificial Intelligence ; Computer Science, Information Systems ; Engineering, Electrical & Electronic
WOS IDWOS:000333532800018
The Source to ArticleScopus
全文获取链接
引用统计
被引频次[WOS]:14   [WOS记录]     [WOS相关记录]
Document TypeJournal article
专题DEPARTMENT OF COMPUTER AND INFORMATION SCIENCE
Affiliation1.Univ Macau, Dept Comp & Informat Sci, Taipa, Macau, Peoples R China
2.Hong Kong Polytech Univ, Dept Comp, Hong Kong, Hong Kong, Peoples R China
First Author AffilicationUniversity of Macau
推荐引用方式
GB/T 7714
Hou U L.,Zhao H.J.,Yiu M.L.,et al. Towards online shortest path computation[J]. IEEE Transactions on Knowledge and Data Engineering,2014,26(4):1012.
APA Hou U L.,Zhao H.J.,Yiu M.L.,Li Y.,&Gong Z..(2014).Towards online shortest path computation.IEEE Transactions on Knowledge and Data Engineering,26(4),1012.
MLA Hou U L.,et al."Towards online shortest path computation".IEEE Transactions on Knowledge and Data Engineering 26.4(2014):1012.
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
Google Scholar
中相似的文章 Google Scholar
[Hou U L.]的文章
[Zhao H.J.]的文章
[Yiu M.L.]的文章
Baidu academic
中相似的文章 Baidu academic
[Hou U L.]的文章
[Zhao H.J.]的文章
[Yiu M.L.]的文章
Bing Scholar
中相似的文章 Bing Scholar
[Hou U L.]的文章
[Zhao H.J.]的文章
[Yiu M.L.]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。