A critical-time-point approach to all-start-time lagrangian shortest paths: a summary of results

Authors:
Venkata M. V. Gunturi;Ernesto Nunes;KwangSoo Yang;Shashi Shekhar
Affiliations:
Computer Science and Engineering, University of Minnesota;Computer Science and Engineering, University of Minnesota;Computer Science and Engineering, University of Minnesota;Computer Science and Engineering, University of Minnesota
Venue:
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Year:
2011

Citing 12
Cited 2

Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

Journal of the ACM (JACM)
Time-Expanded Graphs for Flow-Dependent Transit Times

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Algorithm Design

Algorithm Design
Finding Fastest Paths on A Road Network with Speed Patterns

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Finding time-dependent shortest paths over large graphs

EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Spatio-temporal network databases and routing algorithms: a summary of results

SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
T-drive: driving directions based on taxi trajectories

Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
A Lagrangian approach for storage of spatio-temporal network datasets: a summary of results

Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
A case for time-dependent shortest path computation in spatial networks

Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Minimum spanning tree on spatio-temporal networks

DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
On the complexity of time-dependent shortest paths

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks

IEEE Transactions on Intelligent Transportation Systems

Traffic aware route planning in dynamic road networks

DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
A group based approach for path queries in road networks

SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a spatio-temporal network, a source, a destination, and a start-time interval, the All-start-time Lagrangian Shortest Paths (ALSP) problem determines a path set which includes the shortest path for every start time in the given interval. ALSP is important for critical societal applications related to air travel, road travel, and other spatiotemporal networks. However, ALSP is computationally challenging due to the non-stationary ranking of the candidate paths, meaning that a candidate path which is optimal for one start time may not be optimal for others. Determining a shortest path for each start-time leads to redundant computations across consecutive start times sharing a common solution. The proposed approach reduces this redundancy by determining the critical time points at which an optimal path may change. Theoretical analysis and experimental results show that this approach performs better than naive approaches particularly when there are few critical time points.