相关论文: Calibration of the Particle Density in Cellular-Au…
A recently introduced cellular automaton model for the description of traffic flow is investigated. It generalises asymmetric exclusion models which have attracted a lot of interest in the past. We calculate the so-called fundamental…
We investigate a probabilistic cellular automaton model which has been introduced recently. This model describes single-lane traffic flow on a ring and generalizes the asymmetric exclusion process models. We study the equilibrium properties…
In recent years the modelling of traffic flow using methods from statistical physics, especially cellular automata models have allowed simulations of large traffic networks faster than real time. In this paper, we study a probabilistic…
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)…
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…
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…
In this paper computer simulation results of higher order density correlation for cellular automaton models of traffic flow are presented. The examinations show the jamming transition as a function of both the density and the magnitude of…
A model for 1D traffic flow is developed, which is discrete in space and time. Like the cellular automaton model by Nagel and Schreckenberg [J. Phys. I France 2, 2221 (1992)], it is simple, fast, and can describe stop-and-go traffic. Due to…
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…
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…
A two-dimensional cellular automaton model of traffic flow with open boundaries are investigated by computer simulations. The outflow of cars from the system and the average velocity are investigated. The time sequences of the outflow and…
We use analytical methods to investigate cellular automata for traffic flow. Two different mean-field approaches are presented, which we call site-oriented and car-oriented, respectively. The car-oriented mean-field theory yields the exact…
In this paper a cellular automata model for one-lane traffic flow is presented. A new set of rules is proposed to better capture driver reactions to traffic that are intended to preserve safety on the highway. As a result, drivers behavior…
Defining the density flow of perturbations moving at a given speed for cellular automata, we establish equalities and inequalities between the measurable entropy of a cellular automaton and the measurable entropy of its associated shift.
From the macroscopic viewpoint for describing the acceleration behavior of drivers, this letter presents a weighted probabilistic cellular automaton model (the WP model, for short) by introducing a kind of random acceleration probabilistic…
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…
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…
We present a rigorous derivation of the flow at arbitrary time in a deterministic cellular automaton model of traffic flow. The derivation employs regularities in preimages of blocks of zeros, reducing the problem of preimage enumeration to…
We present a rigorous derivation of the flow at arbitrary time in a deterministic cellular automaton model of traffic flow. The derivation employs regularities in preimages of blocks of zeros, reducing the problem of preimage enumeration to…
We present a rigorous derivation of the flow at arbitrary time in a deterministic cellular automaton model of traffic flow. The derivation employs regularities in preimages of blocks of zeros, reducing the problem of preimage enumeration to…