Coarse-grained cellular automaton for traffic systems
arXiv:1212.2330 · doi:10.1142/S0129183113500113
Abstract
A coarse-grained cellular automaton is proposed to simulate traffic systems. There, cells represent road sections. A cell can be in two states: jammed or passable. Numerical calculations are performed for a piece of square lattice with open boundary conditions, for the same piece with some cells removed and for a map of a small city. The results indicate the presence of a phase transition in the parameter space, between two macroscopic phases: passable and jammed. The results are supplemented by exact calculations of the stationary probabilities of states for the related Kripke structure constructed for the traffic system. There, the symmetry-based reduction of the state space allows to partially reduce the computational limitations of the numerical method.
arXiv comment12 pages, 10 figures
References in corpus (10)
- Congested Traffic States in Empirical Observations and Microscopic Simulations
- Traffic and Related Self-Driven Many-Particle Systems
- Statistical Physics of Vehicular Traffic and Some Related Systems
- Self Organization and a Dynamical Transition in Traffic Flow Models
- Recurrence networks - A novel paradigm for nonlinear time series analysis
- Cellular Automata Models of Road Traffic
- Single-vehicle data of highway traffic - a statistical analysis
- Empirical Traffic Data and Their Implications for Traffic Modeling
- The Physics of Traffic and Regional Development
- Topology of space of periodic ground states in antiferromagnetic Ising and Potts models in selected spatial structures