Related papers: Garden of Eden states in traffic models
Garden of Eden (GOE) states in cellular automata are grid configurations which have no precursors, that is, they can only occur as initial conditions. Finding individual configurations that minimize or maximize some criterion of interest…
In this paper we analyze Garden-of-Eden (GoE) states and fixed points of monotone, sequential dynamical systems (SDS). For any monotone SDS and fixed update schedule, we identify a particular set of states, each state being either a GoE…
We present a new analytical description of the cellular automaton model for single-lane traffic. In contrast to previous approaches we do not use the occupation number of sites as dynamical variable but rather the distance between…
Recently, Huang and Lin suggested a combination of two successfull mean-field theories, the 2-cluster approximation and paradisical mean-field, for the Nagel-Schreckenberg cellular automaton model of traffic flow. We argue that this new…
We investigate a probabilistic cellular automaton model which has been introduced recently. This model describes single-lane traffic flow on a ring and generalizes the asymmetric exclusion process models. We study the equilibrium properties…
We prove the Garden of Eden theorem for cellular automata with finite set of states and finite neighbourhood on right amenable left homogeneous spaces with finite stabilisers. It states that the global transition function of such an…
This paper firstly show that a recent model (Tian et al., Transpn. Res. B 71, 138-157, 2015) is not able to well replicate the evolution concavity in traffic flow, i.e. the standard deviation of vehicles increases in a concave/linear way…
A recently introduced cellular automaton model for the description of traffic flow is investigated. It generalises asymmetric exclusion models which have attracted a lot of interest in the past. We calculate the so-called fundamental…
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…
In this paper, we propose a stochastic cellular automaton model of traffic flow extending two exactly solvable stochastic models, i.e., the asymmetric simple exclusion process and the zero range process. Moreover it is regarded as a…
Suppose $\tau$ is a cellular automaton over an amenable group and a finite alphabet. Celebrated Garden of Eden theorem states, that pre-injectivity of $\tau$ is equivalent to non-existence of Garden of Eden configuration. In this paper we…
In recent years the modelling of traffic flow using methods from statistical physics, especially cellular automata models have allowed simulations of large traffic networks faster than real time. In this paper, we study a probabilistic…
This paper proposes an improved cellular automaton traffic flow model based on the brake light model, which takes into account that the desired time gap of vehicles is remarkably larger than one second. Although the hypothetical steady…
We propose a framework for constructing microscopic traffic models from microscopic acceleration patterns that can in principle be experimental measured and proper averaged. The exact model thus obtained can be used to justify the…
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…
We investigate a simple multisegment cellular automaton model of traffic flow. With the introduction of segment-dependent deceleration probability, metastable congested states in the intermediate density region emerge, and the initial state…
In this paper a cellular automata model for one-lane traffic flow is presented. A new set of rules is proposed to better capture driver reactions to traffic that are intended to preserve safety on the highway. As a result, drivers behavior…
We systematically investigate the effect of blockage sites in a cellular automaton model for traffic flow. Different scheduling schemes for the blockage sites are considered. None of them returns a linear relationship between the fraction…
We present an exact solution of a probabilistic cellular automaton for traffic with open boundary conditions, e.g. cars can enter and leave a part of a highway with certain probabilities. The model studied is the asymmetric exclusion…
We study the statistical properties of a cellular automata model of traffic flow with the look-ahead potential. The model defines stochastic rules for the movement of cars on a lattice. We analyze the underlying statistical assumptions…