相关论文: Generalized Deterministic Traffic Rules

We analyze the steady-state flow as a function of the initial density for a class of deterministic cellular automata rules (``traffic rules'') with periodic boundary conditions [H. Fuks and N. Boccara, Int. J. Mod. Phys. C 9, 1 (1998)]. We…

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…

It is shown that a variety of deterministic cellular automaton models of highway traffic flow obey a variational principle which states that, for a given car density, the average car flow is a non-decreasing function of time. This result is…

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…

We investigate two models for traffic flow with modified acceleration ('slow-to-start') rules. Even in the simplest case $v_{max}=1$ these rules break the 'particle-hole` symmetry of the model. We determine the fundamental diagram…

Microscopic modeling of multi-lane traffic is usually done by applying heuristic lane changing rules, and often with unsatisfying results. Recently, a cellular automaton model for two-lane traffic was able to overcome some of these problems…

We examine various realistic generalizations of the basic cellular automaton model describing traffic flow along a highway. In particular, we introduce a {\em slow-to-start} rule which simulates a possible delay before a car pulls away from…

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 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…

We study several deterministic one-dimensional traffic models. For integer positions and velocities we find the typical high and low density phases separated by a simple transition. If positions and velocities are continuous variables the…

Traffic on a circular road is described by dynamic programming equations associated to optimal control problems. By solving the equations analytically, we derive the relation between the average car density and the average car flow, known…

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…

This paper uses supervised learning, random search and deep reinforcement learning (DRL) methods to control large signalized intersection networks. The traffic model is Cellular Automaton rule 184, which has been shown to be a…

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…

We present an economics-based method for deciding the optimal rates at which vehicles are allowed to enter a highway. The method exploits the naturally occuring fluctuations of traffic flow and is flexible enough to adapt in real time to…

Effects of large value assigned to the maximal car velocity on the fundamental diagrams in the Nagel-Schreckenberg model are studied by extended simulations. The function relating the flow in the congested traffic phase with the car density…

Recent applications of a new methodology to measure fundamental traffic relations on freeways shows that many of the critical parameters of the flow-density and speed-spacing diagrams depend on vehicle length. In response to this fact, we…