Adaptive fastest path computation on a road network: a traffic mining approach
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Finding time-dependent shortest paths over large graphs
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Computing isochrones in multi-modal, schedule-based transport networks
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Towards modeling the traffic data on road networks
Proceedings of the Second International Workshop on Computational Transportation Science
Continuous evaluation of fastest path queries on road networks
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
Efficient best path monitoring in road networks for instant local traffic information
ADC '10 Proceedings of the Twenty-First Australasian Conference on Database Technologies - Volume 104
T-drive: driving directions based on taxi trajectories
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Easiest-to-reach neighbor search
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
Efficient k-nearest neighbor search in time-dependent spatial networks
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part I
A regression-based approach for mining user movement patterns from random sample data
Data & Knowledge Engineering
Driving with knowledge from the physical world
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
A critical-time-point approach to all-start-time lagrangian shortest paths: a summary of results
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Online computation of fastest path in time-dependent spatial networks
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Efficient evaluation of k-NN queries using spatial mashups
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Synthesizing routes for low sampling trajectories with absorbing Markov chains
WAIM'11 Proceedings of the 12th international conference on Web-age information management
Discovering personalized routes from trajectories
Proceedings of the 3rd ACM SIGSPATIAL International Workshop on Location-Based Social Networks
Defining isochrones in multimodal spatial networks
Proceedings of the 20th ACM international conference on Information and knowledge management
Discovering patterns in traffic sensor data
Proceedings of the 2nd ACM SIGSPATIAL International Workshop on GeoStreaming
On the complexity of time-dependent shortest paths
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Towards k-nearest neighbor search in time-dependent spatial network databases
DNIS'10 Proceedings of the 6th international conference on Databases in Networked Information Systems
An a* algorithm framework for the point-to-point time-dependent shortest path problem
CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications
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
The weighted shortest path search based on multi-agents in mobile GIS management services
Wireless Communications & Mobile Computing
Scalable computation of isochrones with network expiration
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
Finding time period-based most frequent path in big trajectory data
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
SMashQ: spatial mashup framework for k-NN queries in time-dependent road networks
Distributed and Parallel Databases
Travel cost inference from sparse, spatio temporally correlated time series using Markov models
Proceedings of the VLDB Endowment
Information Sciences: an International Journal
From taxi GPS traces to social and community dynamics: A survey
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
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.