HOME JOURNALS CONTACT

Information Technology Journal

Year: 2012 | Volume: 11 | Issue: 10 | Page No.: 1508-1512
DOI: 10.3923/itj.2012.1508.1512
Dynamic Analysis of Kalman Filter for Traffic Flow Forecasting in Sensornets
Yan-Chao Zhao, Yan-Chang Liu, Li-Qun Shan and Bin Zhou

Abstract: Intelligent Transportation System (ITS) plays an important role in traffic controlling and traffic guidance which can greatly reduce the cost and pollution. In some senses, efficient traffic controlling is supported by accurate forecasting of the traffic flow and Kalman filter is one of the most used techniques. This study researches some dynamic behaviors of the Kalman filter in traffic flow forecasting. First, some observation nodes are proper set and the traffic flow data can be collected. Then Kalman filter is introduced to forecast the future traffic flow. Finally, the relation between dynamic parameters and forecasting result is analyzed. Several experiments are introduced to verify the conclusion.

Fulltext PDF Fulltext HTML

How to cite this article
Yan-Chao Zhao, Yan-Chang Liu, Li-Qun Shan and Bin Zhou, 2012. Dynamic Analysis of Kalman Filter for Traffic Flow Forecasting in Sensornets. Information Technology Journal, 11: 1508-1512.

Keywords: Kalman filter, forecasting, dynamic analysis and Traffic flow

INTRODUCTION

Sensornets have been applied in many applicable scenarios (Akyildiz et al., 2002, 2007; Tubaishat and Madria, 2003; Shan et al., 2011a) and some observation data can be collected for advanced applications. Most applications will be processing on it, such as traffic controlling, navigation, environment monitoring, and so on (Arici and Altunbasak, 2004; Chong and Kumar, 2003; Wei et al., 2010a; Shan et al., 2010).

More and more vehicles run on the roads with the great development of economy and the caused problems such as pollution, accidents, traffic jams, etc, become more and more serious. Intelligent Transportation System (ITS) can relieve these and it has been a hot issue in the past few years. Traffic controlling and traffic guidance are the most important parts in the system. Lots of researches about traffic controlling have been processed (Smith et al, 2002; Clark, 2003).

Traffic flow is a major factor for people understanding the traffic status and the forecasting of traffic flow is one of the most important problems. Based on the observation data of traffic flow, people can forecast the future traffic flow and some efficient measures can be carried out for avoiding traffic jams, costs and pollution. A real-time, accurate forecasting can plays an activities role in traffic controlling and everyone will be benefited from it. In other words, precise representation of traffic flow evolution is advantageous for traffic controlling. However, the complex dynamics of the evolution are decided by various physical and biochemical factors (Nath and Patil, 2006). Enormous computing cost and time will be required for the representation.

Artificial neural networks (Chau and Cheng, 2002) have been applied in traffic controlling and there are still some drawbacks such as slow training convergence speed and easy entrapment in a local minimum (Dia, 2001). Swarm intelligence is another technique that is developing quickly (Clerc and Kennedy, 2002). This technique has been applied in many problems and some satisfactory results have been presented (Chau, 2004a, b). In some other numerical modeling, the physical problem is represented by highly coupled, non-linear PDEs (Zhou et al., 2011; Feng et al., 2012).

According to the previous researches about sensornets (Gao et al., 2010; Shan et al., 2011b), Kalman filter is introduced to forecast the traffic flow and the dynamic behaviors are also analyzed. Some observation data collected by sensors are used to get some dynamic characters. Then different characters are applied in Kalman filter for the prediction. The relation between the characters and the prediction results is presented at last. The efficiency of our conclusion is verified by some experiments.

TRADITIONAL TRENDS ANALYSIS AND KALMAN FILTER FORECASTING FOR TRAFFIC FLOW

The distribution of observations and evolution of the traffic flow in a region will be considered. For precise represent of the traffic flow evolution, some observation data collected in sensornets should be prepared first.

Some traditional mathematical methods such as polynomial function fitting, nonlinear fitting, least squares estimation, etc., can be used for trends analysis and they have been applied in many fields.

Fig. 1(a-b): Observation data with the traditional result (a) Linear fitting step by step and (b) Quadratic fitting step by step

Assume that the observation data is denoted by (ti, xi), i = 1, 2, ..., n, then a related optimization problem can be presented as:

(1)

where, C means the parameter and energy E(C) denotes the square error. Various formulas of f can be considered for different applications. What’s more, the energy can be linked to other metrics similar with square error. These methods work well when the system is fixed.

However, the real traffic flow system is driven by lots of factors and it is often dynamic. So, the result of trends analysis by them provides few help to next work. As shown in Fig. 1, two traditional results are presented.

Partial differential equations are often related with the complex behaviors and they have been applied in many presented researches, such as constructing potential field (Qiao et al., 2010; Wei et al., 2010b; Zhou et al., 2010a), image segmentation (Zhou et al., 2010b; Zhou and Mu, 2010) and so on. They can be also applied to forecast the traffic flow.

As an efficient technique, Kalman filter has been applied in many researches (Evensen, 2003; Van der Merwe, 2003). The main formulas can be denoted by following:

(2)

(3)

(4)

(5)

where, denotes status vector, Z(k) denotes observation vector, H(k) denotes observation matrix, A(k+1, k) denotes transition matrix, R(k) denotes system error co-variance matrix, Q(k) denotes observation error co-variance matrix.

Equation 2 means the direct forecasting of real status and Eq. 3 denotes gain calculation. Correction of the forecasting result can be completed by Eq. 4 while Eq. 5 shows the recurrence computation of the system co-variance matrix. Set initial value of parameters. These equations can help to complete the forecasting process. The algorithm can be illustrated by Fig. 2.

Here, the system error co-variance R(k) and observation error co-variance Q(k) should be pre-decided.

DYNAMIC ANALYSIS OF KALMAN FILTER FOR TRAFFIC FLOW FORECASTING

Some dynamic behaviors of Kalman filter will be analyzed for traffic flow forecasting. The original observation data collected by sensors is only about traffic flow. However, some information about the forces of evolution system is necessary for the processing of Kalman filter. Here, the traffic flow will be looked as a special ‘shift’ s. Then the velocity and the acceleration will be considered.

Several formulas about the computation of velocity and acceleration can be given as follows:

(6)

(7)

where, v and a denote velocity and acceleration while cj and dj means the weight, Ij denotes the closed set [tj-1, tj]. The computation of v and a will be decided by some assumptions. For example, when v is assumed to be a constant, then it can be calculated by:


Fig. 2: An algorithm for Kalman filter

Fig. 3(a-d): Results with constant velocity, (a) Prediction result and (b) Relative error with increasing weight and (c) Prediction result and (d) Relative error with decreasing weight

When a linear expression v = kt+b is satisfied, it can be determined by this linear system:

(8)

where, tj-1/2 = (tj-1+tj)/2. Similar results can be obtained from the discussion about the acceleration a.

It can be known from Eq. 8 that the velocity v is related with the weight distribution (c1, c2, ..., ci-1). After set the observation vector Z = (s, v, a)T, the forecasting of traffic flow can be achieved by the algorithm as shown in Fig. 2.

NUMERICAL EXPERIMENTS

The proposed model will be used to forecast the traffic flow. First, the collected observation data will be applied to compute the velocity with different assumptions. Then the forecasting can be achieved. As velocity v is constant, the results are shown in Fig. 3.

Fig. 4(a-d): Results with linear velocity, (a) Prediction result and (b) Relative error with increasing weight and (c) Prediction result with decreasing weight and (d) Relative error with decreasing weight

It can be known from the results that the maximal relative error is 8.06% and the average relative error is 1.97% as the weight is linear decreasing. If the weight is linear increasing, the two values can be reduced to 5.27% and 1.71%.

As velocity v is linear, the results are shown in Fig. 4.

It can be known from the results that the maximal relative error is 10.28% and the average relative error is 1.87% as the weight is linear decreasing. If the weight is linear increasing, the two values can be reduced to 5.83% and 1.73%.

CONCLUSIONS

Kalman filter is introduced to forecast traffic flow in this study and some dynamic analysis is processed. Velocity and acceleration are introduced to compose the observation vector in proposed algorithm. After setting proper assumptions on these dynamic parameters and the weight distribution, the forecasting can be achieved. Several experiments with different velocity characters and different weight distributions are presented. The results show that the predictions are related with assumptions of these dynamic parameters and some weight distributions. Exactly, an increasing weight distribution is advantageous than a decreasing one while there is no significant difference between constant velocity and linear velocity.

ACKNOWLEDGMENTS

The authors would like to thank the editor and referees for their valuable comments and suggestions that help to improve this study. This study is supported in part by Science and Technology Research and Development Program of Qinhuangdao (Program No. 201101A229).

REFERENCES

  • Akyildiz, I.F., T. Melodia and K.R. Chowdhury, 2007. A survey on wireless multimedia sensor networks. Comput. Networks, 51: 921-960.
    CrossRef    


  • Arici, T. and Y. Altunbasak, 2004. Adaptive sensing for environment monitoring using wireless sensor networks. Wireless Commun. Networking Conf., 4: 2347-2352.
    CrossRef    Direct Link    


  • Chau, K.W. and C.T. Cheng, 2002. Real-time prediction of water stage with artificial neural network approach. Lect. Notes Artif. Intell., 2557: 715-715.
    CrossRef    


  • Chau, K.W., 2004. Rainfall-runoff correlation with particle swarm optimization algorithm. Lect. Notes Comput. Sci., 3174: 970-975.
    CrossRef    


  • Chau, K.W., 2004. River stage forecasting with particle swarm optimization. Lect. Notes Comput. Sci., 3029: 1166-1173.
    CrossRef    


  • Chong, C.Y. and S.P. Kumar, 2003. Sensor networks: Evolution, opportunities and challenges. Proc. IEEE, 91: 1247-1256.
    CrossRef    Direct Link    


  • Clark, S., 2003. Traffic prediction using multivariate nonparametric regression. J. Transp. Eng., 129: 161-168.
    CrossRef    Direct Link    


  • Clerc, M. and J. Kennedy, 2002. The particle Swarm-explosion, stability and convergence in a multidimensional complex space. IEEE Trans. Evol. Comput., 6: 58-73.
    CrossRef    Direct Link    


  • Dia, H., 2001. An object-oriented neural network approach to short-term traffic forecasting. Eur. J. Operational Res., 131: 253-261.
    CrossRef    


  • Evensen, G., 2003. The Ensemble Kalman Filter: Theoretical formulation and practical implementation. Ocean. Dynamics, 53: 343-367.
    CrossRef    


  • Feng, J., J.Z. Zhang and B. Zhou, 2012. Compact support FDK kernel reconstruction model base on approximate inverse. Math. Problems Eng.,
    CrossRef    


  • Gao, A., W. Wei and X. Xiao, 2010. Multiple hash Sub-chains: Authentication for the hierarchical sensor networks. Inform. Technol. J., 9: 740-748.
    CrossRef    


  • Nath, S. and R.S. Patil, 2006. Prediction of air pollution concentration using an in situ real time mixing height model. Atmos. Environ., 40: 3816-3822.
    CrossRef    


  • Qiao, B.M., B. Zhou, X.L. Yang, W. Wei and R. Liu, 2010. Improved DV-HOP localization based on better weighted Least-square method. Inform. Technol. J., 9: 1172-1177.
    CrossRef    Direct Link    


  • Shan, L.Q., W. Wei and Y. Liu, 2010. Customizable WEB UI of based on templates Inform. Technol. J., 9: 1677-1681.
    CrossRef    Direct Link    


  • Shan, L., J. Wang, Y. Zhao and Y. Liu, 2011. Synchronous aggregation scheduling with minimal latency in multihop sensornet. Inf. Technol. J., 10: 1626-1631.
    CrossRef    


  • Shan, L., Y. Liu and W. Wei, 2011. GRESS: Based on gradient and residual energy of sleep scheduling in the distributed sensor networks. Res. J. Inform. Technol., 3: 132-139.
    CrossRef    Direct Link    


  • Smith, B.L., B.M. Willians and R.K. Oswald, 2002. Comparison of parametric and nonparametric models for traffic flow forecasting. Transp. Res. Part C: Emerging Technol., 10: 303-321.
    CrossRef    Direct Link    


  • Tubaishat, M. and S. Madria, 2003. Sensor networks: An overview. IEEE Potentials, 22: 20-23.
    CrossRef    Direct Link    


  • Van der Merwe, R., 2003. Sigma-point kalman filters for probabilistic inference in Dynamic-state space models. Proceedings of the Workshop on Advances in Machine Learning, June 8-11, 2003, Montreal, Canada -.


  • Wei, W., A. Gao, B. Zhou and Y. Mei, 2010. Scheduling adjustment of mac protocols on cross layer for sensornets. Inform. Technol. J., 9: 1196-1201.
    CrossRef    Direct Link    


  • Wei, W., B. Zhou, A. Gao and Y. Mei, 2010. A new approximation to information fields in sensor nets. Inform. Technol. J., 9: 1415-1420.
    CrossRef    Direct Link    


  • Zhou, B. and C.L. Mu, 2010. Level set evolution for boundary extraction based on a p-laplace equation. Applied Math. Modell., 34: 3910-3916.
    CrossRef    


  • Zhou, B., X.L. Yang and W. Wei, 2010. Constructing smoothing information potential fields with partial differential equations. Inform. Technol. J., 9: 1426-1430.
    CrossRef    Direct Link    


  • Zhou, B., X.L. Yang, R. Liu and W. Wei, 2010. Image segmentation with partial differential equations. Inform. Technol. J., 9: 1049-1052.
    CrossRef    Direct Link    


  • Zhou, B., C.L. Mu, J. Feng and W. Wei, 2011. Continuous level anisotropic diffusion for noise removal. Applied Math. Modell., (In Press).
    CrossRef    


  • Akyildiz, I.F., W. Su, Y. Sankarasubramaniam and E. Cayirci, 2002. Wireless sensor networks: A survey. Comput. Networks, 38: 393-422.
    CrossRef    Direct Link    

  • © Science Alert. All Rights Reserved