Related papers: Cellular Automaton Approach to Pedestrian Dynamics…
We define a cellular automaton where a resting cell excites if number of its excited neighbours belong to some specified interval and boundaries of the interval change depending on ratio of excited and refractory neighbours in the cell's…
A cellular automaton named Rule 184++C is proposed as a meta-model to investigate the flow of various complex particles. In this model, unlike the granular pipe flow and the traffic flow, not only the free-jam phase transition but also the…
The prediction of the behavior of the disease, the level of affectation in a population and the ways to control it are the most important aspects studied by epidemiology using tools such as historical data and mathematical models. So, our…
Heavy traffic congestion daily occurs at merging sections on highway. For releasing this congestion, possibility of alternative configuration of vehicles on multiple-lane road is discussed in this paper. This is the configuration where no…
It is tested in this contribution if and to which extend a method of a pedestrian simulation tool that attempts to make pedestrians walk into the direction of estimated earliest arrival can help to automatically distribute pedestrians - who…
Traffic learning and prediction is at the heart of the evaluation of the performance of telecommunications networks and attracts a lot of attention in wired broadband networks. Now, benefiting from the big data in cellular networks, it…
We investigate the effect of groups on a bi-directional flow, by using novel computational methods. Our focus is on self-organisation phenomena, and more specifically on the time needed for the occurrence of pedestrian lanes, their…
We study a cellular automaton model, which allows diffusion of energy (or equivalently any other physical quantities such as mass of a particular compound) at every lattice site after each timestep. Unit amount of energy is randomly added…
We show that cellular automata can classify data by inducing a form of dynamical phase coexistence. We use Monte Carlo methods to search for general two-dimensional deterministic automata that classify images on the basis of activity, the…
Pedestrian behavior has much more complicated characteristics in a dense crowd and thus attracts the widespread interest of scientists and engineers. However, even successful modeling approaches such as pedestrian models based on particle…
This contribution demonstrates the potential gain for the quality of results in a simulation of pedestrians when estimated remaining travel time is considered as a determining factor for the movement of simulated pedestrians. This is done…
We present a family of one-dimensional cellular automata modeling the diffusion of an innovation in a population. Starting from simple deterministic rules, we construct models parameterized by the interaction range and exhibiting a…
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…
A set of exact solutions for a cellular automaton, which is a hybrid of the optimal velocity and the slow-to-start models, is presented. The solutions allow coexistence of free flows and jamming or slow clusters, which is observed in…
Gliders in one-dimensional cellular automata are compact groups of non-quiescent and non-ether patterns (ether represents a periodic background) translating along automaton lattice. They are cellular-automaton analogous of localizations or…
Cellular Automata (CAs) are computational models that can capture the essential features of systems in which global behavior emerges from the collective effect of simple components, which interact locally. During the last decades, CAs have…
An introduction to cellular automata (both deterministic and probabilistic) with examples. Definition of deterministic automata, dynamical properties, damage spreading and Lyapunov exponents; probabilistic automata and Markov processes,…
A discrete time quantum walk is known to be the single-particle sector of a quantum cellular automaton. For a long time, these models have interested the community for their nice properties such as locality or translation invariance. This…
In recent years modelling crowd and evacuation dynamics has become very important, with increasing huge numbers of people gathering around the world for many reasons and events. The fact that our global population grows dramatically every…
We present an intuitive formalism for implementing cellular automata on arbitrary topologies. By that means, we identify a symmetry operation in the class of elementary cellular automata. Moreover, we determine the subset of topologically…