Related papers: A stochastic cellular automaton model for traffic …
The jam phases in a two-dimensional cellular automata model of traffic flow are investigated by computer simulations. Two different types of the jam phases are found. The spatially diagonal long-range correlation obeys the power law at the…
In this work we propose a car cellular automaton model that reproduces the experimental behavior of traffic flows in Bogot\'a. Our model includes three elements: hysteresis between the acceleration and brake gaps, a delay time in the…
A two--dimensional cellular automaton is introduced to model the flow and jamming of vehicular traffic in cities. Each site of the automaton represents a crossing where a finite number of cars can wait approaching the crossing from each of…
A bottleneck simulation of road traffic on a loop, using the deterministic cellular automata (CA) Nagel-Schreckenberg model with zero dawdling probability, reveals three types of stationary wave solutions. They consist of i) two shock…
A two-dimensional cellular automaton is introduced to model the flow and jamming of vehicular traffic in cities. Each site of the automaton represents a crossing where a finite number of cars can wait approaching the crossing from each of…
It is shown that a variety of deterministic cellular automaton models of highway traffic flow obey a variational principle which states that, for a given car density, the average car flow is a non-decreasing function of time. This result is…
The density classification task is a famous problem in the theory of cellular automata. It is unsolvable for deterministic automata, but recently solutions for stochastic cellular automata have been found. One of them is a set of stochastic…
The proposed stochastic model for pedestrian dynamics is based on existing approaches using cellular automata, combined with substantial extensions, to compensate the deficiencies resulting of the discrete grid structure. This agent motion…
Traffic flow at low densities (free traffic) is characterized by a quasi-one-dimensional relation between traffic flow and vehicle density, while no such fundamental diagram exists for `synchronized' congested traffic flow. Instead, a…
A cellular automaton model of traffic flow taking into account velocity anticipation is introduced. The strength of anticipation can be varied which allows to describe different driving schemes. We find phase separation into a free-flow…
We present analytical results for first-passage processes in a deterministic one-dimensional cellular automaton (CA) model of traffic flow. Starting at time $t=0$ from a random initial state with car density p, at every time step $t\ge 1$…
The jamming transition in the stochastic cellular automaton model (Nagel-Schreckenberg model) of highway traffic is analyzed in detail, by studying the relaxation time, a mapping to surface growth problems and the investigation of…
Exact mean field equations are derived analytically to give the fundamental diagrams, i.e., the average speed - car density relations, for the Fukui-Ishibashi one-dimensional traffic flow cellular automaton model of high speed vehicles…
A two-lane extension of a recently proposed cellular automaton model for traffic flow is discussed. The analysis focuses on the reproduction of the lane usage inversion and the density dependence of the number of lane changes. It is shown…
The theory of urban traffic flow has been developed and new types of meta-automata have emerged and simulate realistic traffic conditions relatively well. Among these models, the brake light model can simulate the three-phase traffic flow…
Based on a detailed microscopic test scenario motivated by recent empirical studies of single-vehicle data, several cellular automaton models for traffic flow are compared. We find three levels of agreement with the empirical data: 1)…
We consider the transition of the Nagel-Schreckenberg traffic flow model from the free flow regime to the jammed regime. We examine the inhomogeneous character of the system by introducing a new method of analysis which is based on the…
We present a rigorous derivation of the flow at arbitrary time in a deterministic cellular automaton model of traffic flow. The derivation employs regularities in preimages of blocks of zeros, reducing the problem of preimage enumeration to…
We present a rigorous derivation of the flow at arbitrary time in a deterministic cellular automaton model of traffic flow. The derivation employs regularities in preimages of blocks of zeros, reducing the problem of preimage enumeration to…
We present a rigorous derivation of the flow at arbitrary time in a deterministic cellular automaton model of traffic flow. The derivation employs regularities in preimages of blocks of zeros, reducing the problem of preimage enumeration to…