Travel Cost Inference from Sparse, Spatio-Temporally Correlated Time Series Using Markov Models

The monitoring of a system can yield a set of measurements that can be modeled as a collection of time series. These time series are often sparse, due to missing measurements, and spatiotemporally correlated, meaning that spatially close time series exhibit temporal correlation. The analysis of such time series offers insight into the underlying system and enables prediction of system behavior. While the techniques presented in the paper apply more generally, we consider the case of transportation systems and aim to predict travel cost from GPS tracking data from probe vehicles. Specifically, each road segment has an associated travel-cost time series, which is derived from GPS data. We use spatio-temporal hidden Markov models (STHMM) to model correlations among different traffic time series. We provide algorithms that are able to learn the parameters of an STHMM while contending with the sparsity, spatio-temporal correlation, and heterogeneity of the time series. Using the resulting STHMM, near future travel costs in the transportation network, e.g., travel time or greenhouse gas emissions, can be inferred, enabling a variety of routing services, e.g., eco-routing. Empirical studies with a substantial GPS data set offer insight into the design properties of the proposed framework and algorithms, demonstrating the effectiveness and efficiency of travel cost inferencing.

[1]  Der-Horng Lee,et al.  Short-term freeway traffic flow prediction : Bayesian combined neural network approach , 2006 .

[2]  Christopher M. Bishop,et al.  Pattern Recognition and Machine Learning (Information Science and Statistics) , 2006 .

[3]  Hesham Rakha,et al.  ESTIMATING VEHICLE FUEL CONSUMPTION AND EMISSIONS BASED ON INSTANTANEOUS SPEED AND ACCELERATION LEVELS , 2002 .

[4]  Matthew Brand,et al.  Coupled hidden Markov models for modeling interacting processes , 1997 .

[5]  Yang Du,et al.  Finding Fastest Paths on A Road Network with Speed Patterns , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[6]  Christian S. Jensen,et al.  Using Incomplete Information for Complete Weight Annotation of Road Networks , 2013, IEEE Transactions on Knowledge and Data Engineering.

[7]  Jeffrey Xu Yu,et al.  Finding time-dependent shortest paths over large graphs , 2008, EDBT '08.

[8]  Joydeep Ghosh,et al.  A New Formulation of Coupled Hidden Markov Models , 2001 .

[9]  Haixun Wang,et al.  Finding semantics in time series , 2011, SIGMOD '11.

[10]  S. Roberts,et al.  Learning interaction dynamics with coupled hidden Markov models , 2000 .

[11]  Guangzhong Sun,et al.  Driving with knowledge from the physical world , 2011, KDD.

[12]  Arnab Bhattacharya,et al.  A continuous query system for dynamic route planning , 2011, 2011 IEEE 27th International Conference on Data Engineering.

[13]  Lawrence R. Rabiner,et al.  A tutorial on hidden Markov models and selected applications in speech recognition , 1989, Proc. IEEE.

[14]  Radford M. Neal Pattern Recognition and Machine Learning , 2007, Technometrics.

[15]  Francisco C. Pereira,et al.  An off-line map-matching algorithm for incomplete map databases , 2009 .

[16]  Jaimyoung Kwon Modeling Freeway Traffic with Coupled HMMs , 2000 .

[17]  Christopher D. Manning,et al.  Introduction to Information Retrieval , 2010, J. Assoc. Inf. Sci. Technol..

[18]  Christian S. Jensen,et al.  EcoMark: evaluating models of vehicular environmental impact , 2012, SIGSPATIAL/GIS.