skip to main content
10.1145/2623330.2623656acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article

Travel time estimation of a path using sparse trajectories

Published:24 August 2014Publication History

ABSTRACT

In this paper, we propose a citywide and real-time model for estimating the travel time of any path (represented as a sequence of connected road segments) in real time in a city, based on the GPS trajectories of vehicles received in current time slots and over a period of history as well as map data sources. Though this is a strategically important task in many traffic monitoring and routing systems, the problem has not been well solved yet given the following three challenges. The first is the data sparsity problem, i.e., many road segments may not be traveled by any GPS-equipped vehicles in present time slot. In most cases, we cannot find a trajectory exactly traversing a query path either. Second, for the fragment of a path with trajectories, they are multiple ways of using (or combining) the trajectories to estimate the corresponding travel time. Finding an optimal combination is a challenging problem, subject to a tradeoff between the length of a path and the number of trajectories traversing the path (i.e., support). Third, we need to instantly answer users' queries which may occur in any part of a given city. This calls for an efficient, scalable and effective solution that can enable a citywide and real-time travel time estimation. To address these challenges, we model different drivers' travel times on different road segments in different time slots with a three dimension tensor. Combined with geospatial, temporal and historical contexts learned from trajectories and map data, we fill in the tensor's missing values through a context-aware tensor decomposition approach. We then devise and prove an object function to model the aforementioned tradeoff, with which we find the most optimal concatenation of trajectories for an estimate through a dynamic programming solution. In addition, we propose using frequent trajectory patterns (mined from historical trajectories) to scale down the candidates of concatenation and a suffix-tree-based index to manage the trajectories received in the present time slot. We evaluate our method based on extensive experiments, using GPS trajectories generated by more than 32,000 taxis over a period of two months. The results demonstrate the effectiveness, efficiency and scalability of our method beyond baseline approaches.

Skip Supplemental Material Section

Supplemental Material

p25-sidebyside.mp4

mp4

304.1 MB

References

  1. S. Chawla, Y. Zheng, J. Hu. 2012. Inferring the Root Cause in Road Traffic Anomalies. In Proc. of IEEE ICDM 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. C. De Fabritiis, R. Ragona, G. Valenti. 2008. Traffic estimation and prediction based on real time floating car data. In Proc. of IEEE ITSC 2008.Google ScholarGoogle ScholarCross RefCross Ref
  3. A. Hofleitner, A. Bayen. 2011. Optimal decomposition of travel times measured by probe vehicles using a statistical traffic flow model. In Proc. of IEEE ITSC 2011.Google ScholarGoogle ScholarCross RefCross Ref
  4. A. Hofleitner, R. Herring, P. Abbeel, A. Bayen. 2012. Learning the dynamics of arterial traffic from probe data using a dynamic Bayesian network. IEEE Trans. on Intelligent Transportation Systems, 13(4), 1679--1693.Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. B. Hull, V. Bychkovsky, Y. Zhang, K. Chen, M. Goraczko, A. Miu, E. Shih, H. Balakrishnan, S. Madden. 2006. CarTel: a distributed mobile sensor computing system. In Proc. of ACM Sensys 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. Han, M. Kamber, J. Pei. 2006. Data mining: concepts and techniques. Morgan kaufmann. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. J. Han, J. Pei, Y. Yin. 2000. Mining frequent patterns without candidate generation. ACM SIGMOD Record, 29(2), 1--12. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. E. Jenelius, H. N. Koutsopoulos. 2013. Travel time estimation for urban road networks using low frequency probe vehicle data. Transportation Research Part B: Methodological, 53, 64--81.Google ScholarGoogle ScholarCross RefCross Ref
  9. Z. Jia, C. Chen, B. Coifman, P. Varaiya. 2001. The PeMS algorithms for accurate, real-time estimates of g-factors and speeds from single-loop detectors. IEEE Trans. on Intelligent Transportation Systems.Google ScholarGoogle Scholar
  10. A. Karatzoglou, X. Amatriain, L. Baltrunas, N. Oliver. 2010. Multiverse recommendation: n-dimensional tensor factorization for context-aware collaborative filtering. In Proc. of ACM Recsys 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. T. V. Larsen. Travel-Time Estimation in Road Networks Using GPS Data. White paper.Google ScholarGoogle Scholar
  12. W. Luo, H. Tan, L. Chen, L. M. Ni. 2013. Finding time period-based most frequent path in big trajectory data. In Proc. of ACM SIGMOD 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. S. Ma, Y. Zheng, O. Wolfson. 2013. T-share: A large-scale dynamic taxi ridesharing service. In Proc. of IEEE ICDE 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. K. F. Pettya, P. Bickelb, J. Jiangc, M. Ostlandb, J. Riceb, Y. Ritovd, F. Schoenbergb. 1998. Accurate estimation of travel times from single-loop detectors. Transportation Research Part A: Policy and Practice, 32(1), 1--17.Google ScholarGoogle ScholarCross RefCross Ref
  15. M. Rahmani, E. Jenelius, H. N. Koutsopoulos. 2013. Route travel time estimation using low-frequency floating car data. In Proc. of IEEE ITSC 2013.Google ScholarGoogle ScholarCross RefCross Ref
  16. J. Rice, E. Van Zwet. 2004. A simple and effective method for predicting travel times on freeways. IEEE Trans. on Intelligent Transportation Systems, 5(3), 200--207. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. R. Sevlian, R. Rajagopal. 2010. Travel Time Estimation Using Floating Car Data. arXiv preprint arXiv:1012.4249.Google ScholarGoogle Scholar
  18. R. Song, W. Sun, B. Zheng, Y. Zheng, C. Tu, S. Li. 2014. PRESS: A Novel Framework of Trajectory Compression in Road Networks. In Proc. of VLDB 2014.Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. C. H. Wu, J. M. Ho, D. T. Lee. 2004. Travel-time prediction with support vector regression. IEEE Trans. on Intelligent Transportation Systems, 5(4), 276--281. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. J. Yuan, Y. Zheng, C. Zhang, W. Xie, X. Xie, G. Sun, Y. Huang. 2010. T-Drive: Driving Directions Based on Taxi Trajectories. In Proc. of ACM SIGSPATIAL 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. J. Yuan, Y. Zheng, C. Zhang, X. Xie, G. Sun. 2010. An interactive-voting based map matching algorithm. In Proc. of IEEE MDM 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. N. J. Yuan, Y. Zheng, L. Zhang, X. Xie. 2013. T-finder: A recommender system for finding passengers and vacant taxis. IEEE Trans. on Knowledge and Data Engineering, 25(10), 2390--2403. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Y. Zheng, Y. Chen, Q. Li, X. Xie, W. Y. Ma. 2010. Understanding transportation modes based on GPS data for web applications. ACM Trans. on the Web, 4(1), 1. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Zheng, Y., Capra, Li, Wolfson, O., Yang, H. 2014. Urban computing: concepts, methodologies, and applications. ACM Trans. on Intelligent systems and Technology, 5(3). Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Data released: http://research.microsoft.com/apps/pubs/?id=217493Google ScholarGoogle Scholar

Index Terms

  1. Travel time estimation of a path using sparse trajectories

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          KDD '14: Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining
          August 2014
          2028 pages
          ISBN:9781450329569
          DOI:10.1145/2623330

          Copyright © 2014 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 24 August 2014

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          KDD '14 Paper Acceptance Rate151of1,036submissions,15%Overall Acceptance Rate1,133of8,635submissions,13%

          Upcoming Conference

          KDD '24

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader