Skip to main content

The System for Predicting the Traffic Flow with the Real-Time Traffic Information

  • Conference paper
Computational Science and Its Applications - ICCSA 2006 (ICCSA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3980))

Included in the following conference series:

Abstract

One of the common services of telematics is the car navigation that finds the shortest path from source to target. Until now, some routing algorithms of the car navigation do not consider the real-time traffic information and use the static shortest path algorithm. In this paper, we proposed the method to predict the traffic flow in the future. This prediction combines two methods. The former is an accumulated speed pattern, which means the analysis results for all past speeds of each road by classifying the same day and the same time interval. The latter is the Kalman filter. We predicted the traffic flows of each segment by combining the two methods. By experiment, we showed our algorithm gave a better precise prediction than only an accumulated speed pattern that is used commonly. The result can be applied to the car navigation to support a dynamic shortest path. In addition, it can give users the travel information to avoid the traffic congestion areas.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kim, J.: Trends of Services and Technology of Telematics. IITA IT Korea (2004)

    Google Scholar 

  2. Chon, H.D., Agrawal, D., Abbadi, A.E.: FATES:Finding A Time dependent Shortest path. In: Proc. of the fourth Intermational Conference on Mobile Data Management, pp. 165–180 (2003)

    Google Scholar 

  3. Handley, S., Langley, P., Rauscher, F.: Learning to Predict the Duration of an Automobile Trip. In: Proc. of the fourth International Conference on Knowledge Discovery and Data Mining, pp. 219–223 (1998)

    Google Scholar 

  4. Moriarty, D., Handley, S., Langley, P.: Learning Distributed Strategies for Traffic Control. In: Proc. of the fifth International Conference of the Society for Adaptive Behavior, pp. 437–446 (1998)

    Google Scholar 

  5. Kalman, R.E.: A New Approach to Linear Filtering and Prediction Problems. Transaction of the ASME Journal of Basic Engineering, 35–45 (March 1960)

    Google Scholar 

  6. Grewal, M.S., Andrews, A.P.: Kalman Filtering: The theory and Practice. Prentice Hall, Englewood Cliffs (1993)

    MATH  Google Scholar 

  7. http://www.etri.re.kr

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cho, MG., Yu, Y.J., Kim, S. (2006). The System for Predicting the Traffic Flow with the Real-Time Traffic Information. In: Gavrilova, M., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3980. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751540_98

Download citation

  • DOI: https://doi.org/10.1007/11751540_98

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34070-6

  • Online ISBN: 978-3-540-34071-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics