A Markov Traffic Model for Signalized Traffic Networks Based on Bayesian Estimation
S.Y. Liu, Shu Lin, Y.B. Wang, Bart De Schutter, William H. K. Lam
Abstract
S.Y. Liu, Shu Lin, Y.B. Wang, Bart De Schutter, William H. K. Lam
Abstract
In order to better understand the stochastic dynamic features of signalized traffic networks, we propose a Markov traffic model to simulate the dynamics of traffic link flow density for signalized urban traffic networks with demand uncertainty. In this model, we have four different state modes for the link according to different congestion levels of the link. Each link can only be in one of the four link state modes at any time, and the transition probability from one state to the other state is estimated by Bayesian estimation based on the distributions of the dynamic traffic flow densities, and the posterior probabilities. Therefore, we use a first-order Markov Chain Model to describe the dynamics of the traffic flow evolution process. We illustrate our approach for a small traffic network. Compared with the data from the microscopic traffic simulator SUMO, the proposed model can estimate the link traffic densities accurately and can give a reliable estimation of the uncertainties in the dynamic process of signalized traffic networks.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In order to better understand the stochastic dynamic features of signalized traffic networks, we propose a Markov traffic model to simulate the dynamics of traffic link flow density for signalized urban traffic networks with demand uncertainty. In this model, we have four different state modes for the link according to different congestion levels of the link. Each link can only be in one of the four link state modes at any time, and the transition probability from one state to the other state is estimated by Bayesian estimation based on the distributions of the dynamic traffic flow densities, and the posterior probabilities. Therefore, we use a first-order Markov Chain Model to describe the dynamics of the traffic flow evolution process. We illustrate our approach for a small traffic network. Compared with the data from the microscopic traffic simulator SUMO, the proposed model can estimate the link traffic densities accurately and can give a reliable estimation of the uncertainties in the dynamic process of signalized traffic networks.
Key concepts: Traffic congestion reconstruction with Kerner's three-phase theory, Traffic generation model, Traffic flow (computer networking), Computer science, Markov chain, Markov process, Microscopic traffic flow model, Traffic equations