Related papers: Cellular automata approach to three-phase traffic …
We introduce a cellular automaton model coupled with a transport equation for flows on graphs. The direction of the flow is described by a switching process where the switching probability dynamically changes according to the value of the…
A simple mechanism for the emergence of complexity in cellular automata out of predictable dynamics is described. This leads to unfold the concept of conditional predictability for systems whose trajectory can only be piecewise known. The…
Cellular automata, CA for short are continuous maps defined on the set of configurations over a finite alphabet A that commutes with the shift. They are characterized by the existence of local function which determine by local behavior the…
This paper studies three classes of cellular automata from a computational point of view: freezing cellular automata where the state of a cell can only decrease according to some order on states, cellular automata where each cell only makes…
Cellular Automata (CA) have long been foundational in simulating dynamical systems computationally. With recent innovations, this model class has been brought into the realm of deep learning by parameterizing the CA's update rule using an…
Measurements of traffic flow show the existence of metastable states of very high throughput. These observations cannot be reproduced by the CA model of Nagel and Schreckenberg (NaSch model), not even qualitatively. Here we present two…
Cellular Automata(CA) is a discrete computing model which provides simple, flexible and efficient platform for simulating complicated systems and performing complex computation based on the neighborhoods information. CA consists of two…
We have found that a variety of phase transitions occurring between three traffic phases (free flow (F), synchronized flow (S), and wide moving jam (J)) determine the spatiotemporal dynamics of traffic consisting of 100% automated-driving…
Deep learning techniques have recently demonstrated broad success in predicting complex dynamical systems ranging from turbulence to human speech, motivating broader questions about how neural networks encode and represent dynamical rules.…
Based on a study of real traffic data measured on American, UK and German freeways common features of traffic congestion relevant for many transportation engineering applications are revealed by the application of Kerner's three-phase…
Emergence of various types of services has brought about explosive growth of traffic as well as diversified traffic characteristics in the cellular networks. To have a comprehensive understanding of the influences caused by various traffic…
Cellular automata (CA) are dynamical systems on symbolic configurations on the lattice. They are also used as models of massively parallel computers. As dynamical systems, one would like to understand the effect of small random…
We extend the theory of Cellular Automata to arbitrary, time-varying graphs. In other words we formalize, and prove theorems about, the intuitive idea of a labelled graph which evolves in time - but under the natural constraint that…
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 dynamical properties of traffic flow using the stochastic car-following model with modified optimal velocity on circular road. The safety distance following the two-second rule and autonomous vehicles, acting as agents,…
In Isliker et al. (2000b), an extended cellular automaton (X-CA) model for solar flares was introduced. In this model, the interpretation of the model's grid-variable is specified, and the magnetic field, the current, and an approximation…
We investigate the dynamical transition from free-flow to jammed traffic, which is related to the divergence of the relaxation time and susceptibility of the energy dissipation rate $E_d$, in the Nagel-Schreckenberg (NS) model with two…
We propose a two dimensional probabilistic cellular automata for the description of traffic flow in a small city network composed of two intersections. The traffic in the network is controlled by a set of traffic lights which can be…
The rule 184 fuzzy cellular automaton is regarded as a mathematical model of traffic flow because it contains the two fundamental traffic flow models, the rule 184 cellular automaton and the Burgers equation, as special cases. We show that…
A Cellular Automata (CA) is a computing model of complex System using simple rule. In CA the problem space into number of cell and each cell can be one or several final state. Cells are affected by neighbours' to the simple rule. Cellular…