The system for predicting the traffic flow with the real-time traffic information

Authors:
Mi-Gyung Cho;Young Jung Yu;SungSoo Kim
Affiliations:
Department of Multimedia Engineering, Tongmyong University, Busan, Korea;Division of Computer Engineering, Pusan University of Foreign Studies, Busan, Korea;Digital Content Research Division, Electronics and Telecommunication Research Institute, Daejeon, Korea
Venue:
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Year:
2006

Citing 3
Cited 0

Kalman filtering: theory and practice

Kalman filtering: theory and practice
Learning distributed strategies for traffic control

Proceedings of the fifth international conference on simulation of adaptive behavior on From animals to animats 5
FATES: Finding A Time dEpendent Shortest path

MDM '03 Proceedings of the 4th International Conference on Mobile Data Management

Quantified Score

Hi-index	0.01

Visualization

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.