Related papers: Cellular Automata For Traffic Flow: Analytical Res…
We have developed a Nagel-Schreckenberg cellular automata model for describing of vehicular traffic flow at a single intersection. A set of traffic lights operating in fixed-time scheme controls the traffic flow. Open boundary condition is…
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…
Pedestrian dynamics exhibits various collective phenomena. Here we study bidirectional pedestrian flow in a floor field cellular automaton model. Under certain conditions, lane formation is observed. Although it has often been studied…
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…
This paper presents a novel approach to the description and understanding of two-dimensional binary cellular automata with the Moore neighborhood that preserve the number of active cells. Such dynamical systems are known to successfully…
A family of multi-value cellular automaton (CA) associated with traffic flow is presented in this paper. The family is obtained by extending the rule-184 CA, which is an ultradiscrete analogue to the Burgers equation. CA models in the…
In this paper I present a first attempt for a possible description of fluids dynamics by mean of a cellular automata technique. With the use of simple and elementary rules, based on random behaviour either, the model permits to obtain the…
A model is proposed to estimate the work zone queue length, and the cellular automata based on empirical data is used for model validation. This estimation model can be applied to work zone organization and management to improve work zone…
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 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…
In this paper, a cellular automaton model of vehicular traffic in Manhattan-like urban system is proposed. In this model, the origin-destination trips and traffic lights have been considered. The system exhibits three different states,…
Autonomous vehicles are essential to future transportation systems, potentially reducing traffic congestion. This study examines the impact of different vehicle control strategies on traffic flow through simulations. We propose a novel…
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…
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 coarse-grained cellular automaton is proposed to simulate traffic systems. There, cells represent road sections. A cell can be in two states: jammed or passable. Numerical calculations are performed for a piece of square lattice with open…
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…
We discuss here the mean-field theory for a cellular automata model of meta-learning. The meta-learning is the process of combining outcomes of individual learning procedures in order to determine the final decision with higher accuracy…
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…