DeepAI AI Chat
Log In Sign Up

Typical Snapshots Selection for Shortest Path Query in Dynamic Road Networks

by   Mengxuan Zhang, et al.

Finding the shortest paths in road network is an important query in our life nowadays, and various index structures are constructed to speed up the query answering. However, these indexes can hardly work in real-life scenario because the traffic condition changes dynamically, which makes the pathfinding slower than in the static environment. In order to speed up path query answering in the dynamic road network, we propose a framework to support these indexes. Firstly, we view the dynamic graph as a series of static snapshots. After that, we propose two kinds of methods to select the typical snapshots. The first kind is time-based and it only considers the temporal information. The second category is the graph representation-based, which considers more insights: edge-based that captures the road continuity, and vertex-based that reflects the region traffic fluctuation. Finally, we propose the snapshot matching to find the most similar typical snapshot for the current traffic condition and use its index to answer the query directly. Extensive experiments on real-life road network and traffic conditions validate the effectiveness of our approach.


page 1

page 2

page 3

page 4


Distributed Processing of k Shortest Path Queries over Dynamic Road Networks

The problem of identifying the k-shortest paths (KSPs for short) in a dy...

Querying Shortest Path on Large Time-Dependent Road Networks with Shortcuts

Querying the shortest path between two vertexes is a fundamental operati...

Multi-Constraint Shortest Path using Forest Hop Labeling

The Multi-Constraint Shortest Path (MCSP) problem aims to find the short...

Space-efficient, Fast and Exact Routing in Time-dependent Road Networks

We study the problem of computing shortest paths in massive road network...

An Efficient Index Method for the Optimal Route Query over Multi-Cost Networks

Smart city has been consider the wave of the future and the route recomm...

Combining Predicted and Live Traffic with Time-Dependent A* Potentials

We study efficient and exact shortest path algorithms for routing on roa...