Related papers: Coarse-grained cellular automaton for traffic syst…
Cellular automata have turned out to be important tools for the simulation of traffic flow. They are designed for an efficient impletmentation on the computer, but hard to treat analytically. Here we discuss several approaches for an…
Heavy traffic congestion daily occurs at merging sections on highway. For releasing this congestion, possibility of alternative configuration of vehicles on multiple-lane road is discussed in this paper. This is the configuration where no…
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 use cellular automata model to study the cooperation between cyclists. In the two-lane model, cyclists can change lanes. Even there is someone on the back they will take a cooperative attitude. It means that they will be in a same…
Any algorithm (in the sense of Gurevich's abstract-state-machine axiomatization of classical algorithms) operating over any arbitrary unordered domain can be simulated by a dynamic cellular automaton, that is, by a pattern-directed cellular…
This study aims at finding a method for constructing molecular dynamics like models using the formalism of cellular automata for fast simulation of fluid dynamic systems (including compressible phenomena). In as much as the results…
We present applications of a cellular automaton approach to pedestrian dynamics introduced in [1,2]. It is shown that the model is able to reproduce collective effects and self-organization phenomena encountered in pedestrian traffic, e.g.…
We study the problem of distributed traffic control in the partitioned plane, where the movement of all entities (robots, vehicles, etc.) within each partition (cell) is coupled. Establishing liveness in such systems is challenging, but…
We present simulations of congested traffic in circular and open systems with a non-local, gas-kinetic-based traffic model and a novel car-following model. The model parameters are all intuitive and can be easily calibrated. Micro- and…
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…
We introduce a new class of probabilistic cellular automata that are capable of exhibiting rich dynamics such as synchronization and ergodicity and can be easily inferred from data. The system is a finite-state locally interacting Markov…
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 either in fixed-time or traffic adaptive scheme controls the traffic flow.…
We define and study a few properties of a class of random automata networks. While regular finite one-dimensional cellular automata are defined on periodic lattices, these automata networks, called randomized cellular automata, are defined…
This paper proposes a method of auto-generation of a centerline graph from a geometrically complex roadmap of real-world traffic systems by using a hierarchical quadtree for cellular automata simulations. Our method is summarized as…
We study the impact of a localized defect in a cellular automaton model for traffic flow which exhibits metastable states and phase separation. The defect is implemented by locally limiting the maximal possible flow through an increase of…
A numerical model is developed for the simulation of debris flow in landslides over a complex three dimensional topography. The model is based on a lattice, in which debris can be transferred among nearest neighbors according to established…
For accurate simulations of rarefied gas flows around moving obstacles, we propose a cut cell method on Cartesian grids: it allows exact conservation and accurate treatment of boundary conditions. Our approach is designed to treat Cartesian…
We propose a characteristic representation ofone-dimensional and 2-state, 3-neighbor cellular automaton rules, which describes an effective form of each rule after many time steps. Simulated results of the representation show that complex…
A macroscopic model is proposed to depict the traffic dynamics involved in urban traffic systems. The link dynamics are described based on the cell-transmission model and bounded by the link capacities, while the flow dynamics are proposed…
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…