Related papers: A 2-Dimensional Cellular Automaton for Agents Movi…
We present a simple one-dimensional Cellular Automaton (CA) which has the property that an initial state composed of two binary numbers evolves quickly into a final state which is their sum. We call this CA the Adding Cellular Automaton…
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…
In this paper we use the cellular automaton (CA) approach to model one-dimensional binary diffusion in solids. Employing a very simple state change rule we define an asynchronous CA model and take its continuum limit to obtain the governing…
We investigate a cellular automaton (CA) model of traffic on a bi-directional two-lane road. Our model is an extension of the one-lane CA model of {Nagel and Schreckenberg 1992}, modified to account for interactions mediated by passing, and…
By the use of computer simulations we investigate, in the cellular automaton of two-dimensional traffic flow, the anisotropic effect of the probabilities of the change of the move directions of cars, from up to right ($p_{ur}$) and from…
We propose a calibrated two-dimensional cellular automaton model to simulate pedestrian motion behavior. It is a v=4 (3) model with exclusion statistics and random shuffled dynamics. The underlying regular grid structure results in a…
The density classification problem is one of the simplest yet non-trivial computing tasks which seem to be ideally suitable for cellular automata (CA). Unfortunately, there exists no one-dimensional two-state CA which classifies binary…
A mutualism is an interaction where the involved species benefit from each other. We study a two-dimensional hexagonal three-state cellular automaton model of a two-species mutualistic system. The simple model is characterized by four…
The transport and chemical reactions of solutes are modelled as a cellular automaton in which molecules of different species perform a random walk on a regular lattice and react according to a local probabilistic rule. The model describes…
The donation game is a well-established framework for studying the emergence and evolution of cooperation in multi-agent systems. The cooperative behavior can be influenced by the environmental noise in partially observable settings and by…
The cellular automaton model for traffic flow exhibits a jamming transition from a free-flow phase to a congested phase. In the deterministic case this transition corresponds to a critical point with diverging correlation length. In the…
Cellular automata (CA) consist of an array of identical cells, each of which may take one of a finite number of possible states. The entire array evolves in discrete time steps by iterating a global evolution G. Further, this global…
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…
Cellular automata are often used to model systems in physics, social sciences, biology that are inherently asynchronous. Over the past 20 years, studies have demonstrated that the behavior of cellular automata drastically changed under…
This paper considers a two-dimensional persistent monitoring problem by controlling movements of second-order agents to minimize some uncertainty metric associated with targets in a dynamic environment. In contrast to common sensing models…
We show techniques of analyzing complex dynamics of cellular automata (CA) with chaotic behaviour. CA are well known computational substrates for studying emergent collective behaviour, complexity, randomness and interaction between order…
We study the spreading of excitations in 2D systems of mobile agents where the excitation is transmitted when a quiescent agent keeps contact with an excited one during a non-vanishing time. We show that the steady states strongly depend on…
Cellular Automata (CA) are a class of discrete dynamical systems that have been widely used to model complex systems in which the dynamics is specified at local cell-scale. Classically, CA are run on a regular lattice and with perfect…
A probabilistic cellular automaton for cargo transport is presented that generalizes the totally asymmetric exclusion process with a defect from continuous time to parallel dynamics. It appears as an underlying principle in cellular…
Given a connected region in two-dimensional space where events of a certain kind occur according to a certain time-varying density, we consider the problem of setting up a network of autonomous mobile agents to detect the occurrence of…