Related papers: Coarse-grained cellular automaton for traffic syst…
This paper presents a novel approach to the description and understanding of two-dimensional binary cellular automata with the Moore neighborhood that preserve the number of active cells. Such dynamical systems are known to successfully…
Cellular automata are a set of computational models in discrete space that have a discrete time evolution defined by neighbourhood rules. They are used to simulate many complex systems in physics and science in general. In this work,…
We present a new cellular automata model of vehicular traffic in cities by combining ideas borrowed from the Biham-Middleton-Levine (BML) model of city traffic and the Nagel-Schreckenberg (NaSch) model of highway traffic. The model exhibits…
This paper proposes several algorithms and their Cellular Automata Machine (CAM) for drawing the State Transition Diagram (STD) of an arbitrary Cellular Automata (CA) Rule (any neighborhood, uniform/ hybrid and null/ periodic boundary) and…
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…
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…
This paper introduces a fuzzy cellular model of road traffic that was intended for on-line applications in traffic control. The presented model uses fuzzy sets theory to deal with uncertainty of both input data and simulation results.…
Cellular automaton (CA) approach is an important theoretical framework for studying complex system behavior and has been widely applied in various research field. CA traffic flow models have the advantage of flexible evolution rules and…
We present a 2-dimensional cellular automaton model for the simulation of pedestrian dynamics. The model is extremely efficient and allows simulations of large crowds faster than real time since it includes only nearest-neighbour…
Cellular automata (CA) are discrete-time dynamical systems with local update rules on a lattice. Despite their elementary definition, CA support a wide spectrum of macroscopic phenomena central to statistical physics: equilibrium and…
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…
This study proposes a novel adaptive traffic signal control method leveraging a Deep Q-Network (DQN) and Proximal Policy Optimization (PPO) to optimize signal timing by integrating variable cell length and multi-channel state…
It is suggested that the question of existence of a jamming phase transition in a broad class of single-lane cellular-automaton traffic models may be studied using a correspondence to the asymmetric chipping model. In models where such…
The Nagel-Schreckenberg model is a simple cellular automaton for a realistic description of single-lane traffic on highways. For the case $v_{max}=1$ the properties of the stationary state can be obtained exactly. For the more relevant case…
We introduce density dependence of the cell size in cellular-automaton models for traffic flow, which allows a more precise correspondence between real-world phenomena and what observed in simulation. Also, we give an explicit calibration…
Emergent processes in complex systems such as cellular automata can perform computations of increasing complexity, and could possibly lead to artificial evolution. Such a feat would require scaling up current simulation sizes to allow for…
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…
In recent works, we have proposed a stochastic cellular automaton model of traffic flow connecting two exactly solvable stochastic processes, i.e., the Asymmetric Simple Exclusion Process and the Zero Range Process, with an additional…
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 propose a bridge between the theory of exactly solvable models and the investigation of traffic flow. By choosing the activities in an apropriate way the dimer configurations of the Kasteleyn model on a hexagonal lattice can be…