Related papers: Two Lane Traffic Simulations using Cellular Automa…
The jam phases in a two-dimensional cellular automata model of traffic flow are investigated by computer simulations. Two different types of the jam phases are found. The spatially diagonal long-range correlation obeys the power law at the…
A two--dimensional cellular automaton is introduced to model the flow and jamming of vehicular traffic in cities. Each site of the automaton represents a crossing where a finite number of cars can wait approaching the crossing from each of…
Measurements on real traffic have revealed the existence of metastable states with very high flow. Such states have not been observed in the Nagel-Schreckenberg (NaSch) model which is the basic cellular automaton for the description of…
Based on a detailed microscopic test scenario motivated by recent empirical studies of single-vehicle data, several cellular automaton models for traffic flow are compared. We find three levels of agreement with the empirical data: 1)…
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…
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…
We present an exact solution of a probabilistic cellular automaton for traffic with open boundary conditions, e.g. cars can enter and leave a part of a highway with certain probabilities. The model studied is the asymmetric exclusion…
We introduce a rigorous framework for stochastic cell transmission models for general traffic networks. The performance of traffic systems is evaluated based on preference functionals and acceptable designs. The numerical implementation…
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…
A stochastic cellular automata (CA) model for pedestrian dynamics is presented. Our goal is to simulate different types of pedestrian movement, from regular to panic. But here we emphasize regular situations which imply that pedestrians…
We propose a cellular automata model for vehicular traffic in cities by combining (and appropriately modifying) ideas borrowed from the Biham-Middleton-Levine (BML) model of city traffic and the Nagel-Schreckenberg (NS) model of highway…
In this work we propose a car cellular automaton model that reproduces the experimental behavior of traffic flows in Bogot\'a. Our model includes three elements: hysteresis between the acceleration and brake gaps, a delay time in the…
We investigate a simple multisegment cellular automaton model of traffic flow. With the introduction of segment-dependent deceleration probability, metastable congested states in the intermediate density region emerge, and the initial state…
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…
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.…
The main contribution reported in the paper is a novel paradigm through which mobile cellular traffic forecasting is made substantially more accurate. Specifically, by incorporating freely available road metrics we characterise the data…
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 use cellular automata model to study the cooperation between cyclists. In the two-lane model, cyclists can change lanes. Even there is someone on the back they will take a cooperative attitude. It means that they will be in a same…
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…
This paper presents a classification of Cellular Automata rules based on its properties at the nth iteration. Elaborate computer program has been designed to get the nth iteration for arbitrary 1-D or 2-D CA rules. Studies indicate that the…