Related papers: Cellular Automata For Traffic Flow: Analytical Res…
Cellular automata (CA) play an important role in the development of computationally efficient microscopic traffic models and recently have gained considerable importance as a mean of optimising traffic control strategies. However, real-time…
We propose a two dimensional probabilistic cellular automata for the description of traffic flow in a small city network composed of two intersections. The traffic in the network is controlled by a set of traffic lights which can be…
We propose a probabilistic cellular automata model for the spread of innovations, rumors, news, etc. in a social system. The local rule used in the model is outertotalistic, and the range of interaction can vary. When the range R of the…
We have developed a modified Nagel-Schreckenberg cellular automata model for describing a conflicting vehicular traffic flow at the intersection of two streets. No traffic lights control the traffic flow. The approaching cars to the…
Exact mean field equations are derived analytically to give the fundamental diagrams, i.e., the average speed - car density relations, for the Fukui-Ishibashi one-dimensional traffic flow cellular automaton model of high speed vehicles…
A cellular automaton model of traffic flow taking into account velocity anticipation is introduced. The strength of anticipation can be varied which allows to describe different driving schemes. We find phase separation into a free-flow…
In urban streets, the intrusion of pedestrians presents significant safety challenges. Modelling mixed pedestrian-vehicle traffic is complex due to the distinct motion characteristics and spatial dimensions of pedestrians and vehicles,…
A probabilistic cellular automaton for cargo transport is presented that generalizes the totally asymmetric exclusion process with a defect from continuous time to parallel dynamics. It appears as an underlying principle in cellular…
There have been several highway traffic models proposed based on cellular automata. The simplest one is elementary cellular automaton rule 184. We extend this model to city traffic with cellular automata coupled at intersections using only…
We study a family of deterministic models for highway traffic flow which generalize cellular automaton rule 184. This family is parametrized by the speed limit $m$ and another parameter $k$ that represents a ``degree of aggressiveness'' in…
Within the class of stochastic cellular automata models of traffic flows, we look at the velocity dependent randomization variant (VDR-TCA) whose parameters take on a specific set of extreme values. These initial conditions lead us to the…
A new cellular automaton (CA) traffic model is presented. The focus is on mechanical restrictions of vehicles realized by limited acceleration and deceleration capabilities. These features are incorporated into the model in order to…
We investigate dynamical properties of traffic flow using the stochastic car-following model with modified optimal velocity on circular road. The safety distance following the two-second rule and autonomous vehicles, acting as agents,…
While many classical traffic models treat the spatial extension of streets continuously or by discretization into cells of a certain length, we will subdivide roads into comparatively long homogeneous road sections of constant capacity with…
We introduce an enhanced model based on the generalized centrifugal force model. Furthermore, the desired direction of pedestrians is investigated. A new approach leaning on the well-known concept of static and dynamic floor-fields in…
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…
We suggest a disordered traffic flow model that captures many features of traffic flow. It is an extension of the Nagel-Schreckenberg (NaSch) stochastic cellular automata for single line vehicular traffic model. It incorporates random…
This paper presents a class of one-dimensional cellular automata (CA) models on traffic flows, featuring nonlocal look-ahead interactions. We develop kinetic Monte Carlo (KMC) algorithms to simulate the dynamics. The standard KMC method can…
A system of agents moving along a road in both directions is studied numerically within a cellular-automata formulation. An agent steps to the right with probability $q$ or to the left with $1-q$ when encountering other agents. Our model is…
A cellular automata approach using a Directed Cyclic Graph is used to model interrelationships of fluctuating time, state and space. This model predicts phenomena including a constant and maximum speed at which any moving entity can travel,…