期刊
DISTRIBUTED AND PARALLEL DATABASES
卷 33, 期 2, 页码 227-252出版社
SPRINGER
DOI: 10.1007/s10619-014-7146-x
关键词
Route planning; Road networks; Road hierarchy; Dynamic road networks; Spatio-temporal analysis; Query processing
资金
- NSFC [61232006, 91124001, 61379033, 61003049, 61073061, 61202064]
- Fundamental Research Funds for the Central Universities [2013QNA5020]
- Key Project of Zhejiang University Excellent Young Teacher Fund (Zijin Plan)
- ARC [DP120102627]
The widespread use of GPS navigations and trip planning on web has aroused considerable interests in fast and scalable path query processing. Existing research has mostly focused on static route optimization where the traffic network is assumed to be stable. Nevertheless, in most cases, route planning is in the presence of frequent updates to the traffic graph due to the dynamic nature of traffic network, and such updates always greatly affect the performance of route planning. Most existing methods, however, cannot efficiently support traffic aware route planning. In this paper, two efficient strategies are proposed to handle this problem. We analyze the traffic condition on the road network and explore spatio-temporal knowledge to guide effective route planning. In particular, several effective techniques are employed to avoid both unnecessary calculations on huge graph and excessive re-calculations caused by traffic condition updates. A comprehensive experiment is also conducted to evaluate the performance of our proposed strategies.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据