Browse > Article

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

Yu Young-Jung (부산외국어대학교 컴퓨터공학부)
Cho Mi-Gyung (동명대학교 멀티미디어공학과)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.10, no.7, 2006 , pp. 1312-1318 More about this Journal
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 prosed 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 classfying the same day and the same time inteval. 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 better precise predicition than only using 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.
Keywords
텔레메틱스;속도 예측;교통 혼잡;실시간 교통 정보;
Citations & Related Records
연도 인용수 순위
  • Reference
1 D. Moriarty, S. Handley, P.Langley, 'Learning Distributed Strategies for Traffic Control,' Proceedings of the Fifth International Conference of the Society for Adaptive Behavior, pp. 437-446, Zurich, Switzerland, 1998
2 Kalman, R. E., 'A New Approach to Linear Filtering and Prediction Problems,' Transaction of the ASME Journal of Basic Engineering, pp. 35-45, March, 1960
3 Joonwan Kim, Trends of Services and Technology of Telematics, IITA IT Korea, 2004
4 grewal, Mohinder S., and Angus P. Andrews, Kalman Filtering: The theory and Practice, Prentice Hall, 1993
5 S. Handley, P. Langley and F. Rauscher, 'Learning to Predict the Duration of an Automobile Trip,' Proc. Of the 4th International Conference on Knowledge Discovery and Data Mining, pp. 219-223, 1998, New Work
6 H. D. Chon, D. Agrawal and A. E. Abbadi, 'FATES:Finding A Time dEpendent Shortest path,' Proc. of the 4th Intermational Conference on Mobile Data Management, pp. 165-180 2003   DOI   ScienceOn