Finding fastest paths on a road network with speed patterns

DMCA

Finding fastest paths on a road network with speed patterns (2006)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Evangelos Kanoulas , Yang Du , Tian Xia , Donghui Zhang

Venue:	In Proc. Int. Conf. on Data Engineering (ICDE’06
Citations:	45 - 0 self

BibTeX

@INPROCEEDINGS{Kanoulas06findingfastest,
    author = {Evangelos Kanoulas and Yang Du and Tian Xia and Donghui Zhang},
    title = {Finding fastest paths on a road network with speed patterns},
    booktitle = {In Proc. Int. Conf. on Data Engineering (ICDE’06},
    year = {2006}
}

OpenURL

Abstract

This paper proposes and solves the Time-Interval All Fastest Path (allFP) query. Given a user-defined leaving or arrival time interval I, a source node s and an end node e, allFP asks for a set of all fastest paths from s to e, one for each sub-interval of I. Note that the query algorithm should find a partitioning of I into sub-intervals. Existing methods can only be used to solve a very special case of the problem, when the leaving time is a single time instant. A straightforward solution to the allFP query is to run existing methods many times, once for every time instant in I. This paper proposes a solution based on novel extensions to the A * algorithm. Instead of expanding the network many times, we expand once. The travel time on a path is kept as a function of leaving time. Methods to combine travel-time functions are provided to expand a path. A novel lower-bound estimator for travel time is proposed. Performance results reveal that our method is more efficient and more accurate than the discrete-time approach. 1

Keyphrases

speed pattern road network travel time method many time travel-time function arrival time interval allfp asks straightforward solution special case time instant source node discrete-time approach time-interval fastest path network many time query algorithm novel lower-bound estimator leaving time single time instant user-defined leaving novel extension performance result allfp query end node

DMCA