Related papers: Two-dimensional traffic rules and the density clas…
This is a study of localised structures in one-dimensional cellular automata, with the elementary cellular automaton Rule 54 as a guiding example. A formalism for particles on a periodic background is derived, applicable to all…
We investigate a one-dimensional system of $N$ particles, initially distributed with random positions and velocities, interacting through binary collisions. The collision rule is such that there is a time after which the $N$ particles do…
We consider the Follow-The-Leader approximation of the Aw-Rascle-Zhang (ARZ) model for traffic flow in a multi-population formulation. We prove rigorous convergence to weak solutions of the ARZ system in the many particle limit in presence…
The aim of this work is to introduce a two-dimensional macroscopic traffic model for multiple populations of vehicles. Starting from the paper [20], where a two-dimensional model for a single class of vehicles is proposed, we extend the…
In this paper, a particle method is used to approximate the solutions of a "fluid-like" macroscopic traffic flow model for automated vehicles. It is shown that this method preserves certain differential inequalities that hold for the…
Modeling and control of agent-based models is twice cursed by the dimensionality of the problem, as both the number of agents and their state space dimension can be large. Even though the computational barrier posed by a large ensemble of…
We consider the problem of computing a response curve for binary cellular automata -- that is, the curve describing the dependence of the density of ones after many iterations of the rule on the initial density of ones. We demonstrate how…
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…
This paper studies the optimal solution of the classical problem of detecting the location of multiple image occurrences in a two-dimensional, noisy measurement. Assuming the image occurrences do not overlap, we formulate this task as a…
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…
The one-parameter two-dimensional cellular automaton with the Margolus neighbourhood is analyzed based on the considering the projection of the stochastic movements of a single particle. Introducing the auxiliary random variable associated…
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…
Summary: Traffic light coordination is a complex problem. In this paper, we extend previous work on an abstract model of city traffic to allow for multiple street intersections. We test a self-organizing method in our model, showing that it…
Number-conserving (or {\em conservative}) cellular automata have been used in several contexts, in particular traffic models, where it is natural to think about them as systems of interacting particles. In this article we consider several…
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…
A traffic model on an open one-dimensional lattice is considered. At any discrete time moment, with prescribed probability, a particle arrives to the leftmost cell of the lattice, and, with prescribed probability, the arriving particle…
Driven many-particle systems with nonlinear interactions are known to often display multi-stability, i.e. depending on the respective initial condition, there may be different outcomes. Here, we study this phenomenon for traffic models,…
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…
This paper shows how to determine all the unidimensional two-state cellular automaton rules of a given number of inputs which conserve the number of active sites. These rules have to satisfy a necessary and sufficient condition. If the…
In this work we consider the problem of finding the minimum-weight loop cover of an undirected graph. This combinatorial optimization problem is called 2-matching and can be seen as a relaxation of the traveling salesman problem since one…