Related papers: Cellular Automata Models of Road Traffic
Cyclic cellular automata (CCA) are models of excitable media. Started from random initial conditions, they produce several different kinds of spatial structure, depending on their control parameters. We introduce new tools from information…
Within the class of stochastic cellular automata models of traffic flows, we look at the velocity dependent randomization variant (VDR-TCA) whose parameters take on a specific set of extreme values. These initial conditions lead us to the…
We construct a cellular automaton (CA) model that describes the movement of a particle in a disordered system. The mathematical properties of the CA model were examined by varying the configuration of grid and determining the number of…
A family of multi-value cellular automaton (CA) associated with traffic flow is presented in this paper. The family is obtained by extending the rule-184 CA, which is an ultradiscrete analogue to the Burgers equation. CA models in the…
Microscopic modeling of multi-lane traffic is usually done by applying heuristic lane changing rules, and often with unsatisfying results. Recently, a cellular automaton model for two-lane traffic was able to overcome some of these problems…
It is shown that the desire for smooth and comfortable driving is directly responsible for the occurrence of complex spatio-temporal structures (``synchronized traffic'') in highway traffic. This desire goes beyond the avoidance of…
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…
We present time-constrained automata (TCA), a model for hard real-time computation in which agents behaviors are modeled by automata and constrained by time intervals. TCA actions can have multiple start time and deadlines, can be…
Cellular automata (CAs) are dynamical systems which exhibit complex global behavior from simple local interaction and computation. Since the inception of cellular automaton (CA) by von Neumann in 1950s, it has attracted the attention of…
Cellular automata are a discrete dynamical system which models massively parallel computation. Much attention is devoted to computations with small time complexity for which the parallelism may provide further possibilities. In this paper,…
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…
A new kind of cellular automaton (CA) for the study of the dynamics of urban systems is proposed. The state of a cell is not described using a finite set, but by means of continuum variables. A population sector is included, taking into…
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…
The model of cellular automata is fascinating because very simple local rules can generate complex global behaviors. The relationship between local and global function is subject of many studies. We tackle this question by using results on…
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…
This paper presents a new class of one-dimensional (1D) traffic models with look-ahead rules that take into account of two effects: nonlocal slow-down effect and right-skewed non-concave asymmetry in the fundamental diagram. The proposed 1D…
In this paper we present a theoretical analysis of a recently proposed two-dimensional Cellular Automata model for traffic flow in cities with the novel ingredient of turning capability. Numerical simulations of this model show that there…
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…
Cellular automata (CA) have been utilized for decades as discrete models of many physical, mathematical, chemical, biological, and computing systems. The most widely known form of CA, the elementary cellular automaton (ECA), has been…
A small-world cellular automaton network has been formulated to simulate the long-range interactions of complex networks using unconventional computing methods in this paper. Conventional cellular automata use local updating rules. The new…