Decentralized Cooperation Strategies in Two-Dimensional Traffic of Cellular Automata

We study the two-dimensional traffic of cellular automata using computer simulation. We propose two type of decentralized cooperation strategies, which are called stepping aside (CS-SA) and choosing alternative routes (CS-CAR) respectively. We introduce them into an existing two-dimensional cellular automata (CA) model. CS-SA is designed to prohibit a kind of ping-pong jump when two objects standing together try to move in opposite directions. CS-CAR is designed to change the solution of conflict in parallel update. CS-CAR encourages the objects involved in parallel conflicts choose their alternative routes instead of waiting. We also combine the two cooperation strategies (CS-SA-CAR) to test their combined effects. It is found that the system keeps on a partial jam phase with nonzero velocity and flow until the density reaches one. The ratios of the ping-pong jump and the waiting objects involved in conflict are decreased obviously, especially at the free phase. And the average flow is improved by the three cooperation strategies. Although the average travel time is lengthened a bit by CS-CAR, it is shorten by CS-SA and CS-SA-CAR. In addition, we discuss the advantage and applicability of decentralized cooperation modeling.     

Cellular Automata Models of Traffic Behavior in Presence of SpeedBreaking Structures

In this article, we study traffic flow in the presence ofspeed breaking structures. The speed breakers are typically used toreduce the local speed of vehicles near certain institutions such asschools and hospitals. Through a cellular automata model we study the impact of such structures on global traffic characteristics. The simulation results indicate that the presence of speed breakers could reduce the global flow under moderate global densities. However, under low and high global density traffic regime the presence of speed breakers does not have an impact on the global flow. Further the speed limit enforced by the speed breaker createsa phase distinction. For a given global density and slowdown probability, as the speed limit enforced by the speed breaker increases, the traffic moves from the reduced flow phase to maximum flow phase. This underlines the importance of proper design of these structures to avoid undesired flow restrictions.     

Cellular Automata Models of Traffic Behavior in Presence of Speed Breaking Structures

In this article, we study traffic flow in the presence of speed breaking structures. The speed breakers are typically used to reduce the local speed of vehicles near certain institutions such as schools and hospitals. Through a cellular automata model we study the impact of such structures on giobal traffic characteristics. The simulation results indicate that the presence of speed breakers could reduce the global flow under moderate global densities. However, under low and high global density traffic regime the presence of speed breakers does not have an impact on the global flow. Further the speed limit enforced by the speed breaker creates a phase distinction. For a given global density and slowdown probability, as the speed limit enforced by the speed breaker increases, the traffic moves from the reduced flow phase to maximum flow phase. This underlines the importance of proper design of these structures to avoid undesired flow restrictions.     

Two-Dimensional Cellular Automata for Pseudo-Random Pattern Generators and for Highly Secure Stream Ciphers

Pseudo-random properties of a class of two-dimensional (2-D) 5-neighborhood cellular automata (CA), built around nonlinear (OR, AND) and linear (XOR) Boolean functions are studied. The site values at each step of the 2-D CA evolution are taken in parallel and form pseudo-random sequences, which satisfy the criteria established for pseudo random number generator (PRNG): long period, excellent random qualities, single bit error propagation (avalanche criteria), easy and fast generation of the random bits. A block-scheme for secure Stream Cipher based on 2-D CA is proposed. The 2-D CA based PRNG algorithm has simple structure, use space-invariant and local interconnections and can be easily realized in very large scale integration or parallel optoelectronic architectures.     

A Cellular Automaton Model for Two-Lane Traffic

We present some long time limit properties of a cellular automaton that models traffic of cars on a (infinite) two-lane road. This model, called TL184, is a natural generalization of the cellular automaton classified as 184 by Wolfram (to be abbreviated by CA184) and studied before as a model for one-lane traffic. TL184 models cars' motions on each lane by particles that interact via the CA184 rules, and cars' lane changes by a possibility for particles to flip from one CA184 to another. We calculate the infinite-time limit of the particle current in TL184, starting from a translation invariant measure, and use this result to show how the possibility of lane changes may enhance the current of cars in TL184 compared to that in a corresponding model of two non-interacting one-lane roads. We provide examples which demonstrate that even though the rules that regulate lane changes are completely symmetric, the system does not evolve to an equipartition of cars among both lanes from a given initially asymmetric distribution; moreover, the asymptotic car velocities and currents may be different on different lanes. We also show that, for a particular class of initial distributions, the asymptotic car density on a lane may be a non-monotonic function of the initial car density on this lane. Finally, we derive the current-density relation for an extended continuous-time version of TL184 with asymmetric lane-changing rules.     

Modeling and Simulation for Urban Rail Traffic Problem Based on Cellular Automata

Based on the Nagel-Schreckenberg model, we propose a new cellular automata model to simulate the urban rail traffic flow under moving block system and present a new minimum instantaneous distance formula under pure moving block. We also analyze the characteristics of the urban rail traffic flow under the influence of train density, station dwell times, the length of train, and the train velocity. Train delays can be decreased effectively through flexible departure intervals according to the preceding train type before its departure. The results demonstrate that a suitable adjustment of the current train velocity based on the following train velocity can greatly shorten the minimum departure intervals and then increase the capacity of rail transit.     

Modeling and Simulation for Urban Rail Traffic Problem Based on Cellular Automata

Based on the Nagel-Schreckenberg model, we propose a new cellular automata model to simulate the urban rail traffic flow under moving block system and present a new minimum instantaneous distance formula under pure moving block. We also analyze the characteristics of the urban rail traffic flow under the influence of train density, station dwell times, the length of train, and the train velocity. Train delays can be decreased effectively through flexible departure intervals according to the preceding train type before its departure. The results demonstrate that a suitable adjustment of the current train velocity based on the following train velocity can greatly shorten the minimum departure intervals and then increase the capacity of rail transit.     

A Two-Lane Cellular Automata Model with Influence of Next-Nearest Neighbor Vehicle

In this paper, we propose a new two-lane cellular automata model in which the influence of the next-nearest neighbor vehicle is considered. The attributes of the traffic system composed of fast-lane and slow-lane are investigated by the new traffic model. The simulation results show that the proposed two-lane traffic model can reproduce some traffic phenomena observed in real traffic, and that maximum flux and critical density are close to the field measurements.Moreover, the initial density distribution of the fast-lane and slow-lane has much influence on the traffic flow states.With the ratio between the densities of slow lane and fast lane increasing the lane changing frequency increases, but maximum flux decreases. Finally, the influence of the sensitivity coefficients is discussed.     

Entropy-Based Classification of Elementary Cellular Automata under Asynchronous Updating: An Experimental Study

Classification of asynchronous elementary cellular automata (AECAs) was explored in the first place by Fates et al. (Complex Systems, 2004) who employed the asymptotic density of cells as a key metric to measure their robustness to stochastic transitions. Unfortunately, the asymptotic density seems unable to distinguish the robustnesses of all AECAs. In this paper, we put forward a method that goes one step further via adopting a metric entropy (Martin, Complex Systems, 2000), with the aim of measuring the asymptotic mean entropy of local pattern distribution in the cell space of any AECA. Numerical experiments demonstrate that such an entropy-based measure can actually facilitate a complete classification of the robustnesses of all AECA models, even when all local patterns are restricted to length 1. To gain more insights into the complexity concerning the forward evolution of all AECAs, we consider another entropy defined in the form of Kolmogorov–Sinai entropy and conduct preliminary experiments on classifying their uncertainties measured in terms of the proposed entropy. The results reveal that AECAs with low uncertainty tend to converge remarkably faster than models with high uncertainty.     

Dualities for a Class of Finite Range Probabilistic Cellular Automata in One Dimension

In this paper we study dualities for a class of one-dimensional probabilistic cellular automata with finite range interactions by using a sequence of extended cellular automata.     

Limit Sets of Cellular Automata Associated to Probability Measures

We introduce the concept of limit set associated to a cellular automaton (CA) and a shift invariant probability measure. This is a subshift whose forbidden blocks are exactly those, whose probabilities tend to zero as time tends to infinity. We compare this probabilistic concept of limit set with the concepts of attractors, both in topological and measure-theoretic sense. We also compare this notion with that of topological limit set in different dynamical situations.     

Modeling Oxidation of AlCoCrFeNi High-Entropy Alloy Using Stochastic Cellular Automata

Together with the thermodynamics and kinetics, the complex microstructure of high-entropy alloys (HEAs) exerts a significant influence on the associated oxidation mechanisms in these concentrated solid solutions. To describe the surface oxidation in AlCoCrFeNi HEA, we employed a stochastic cellular automata model that replicates the mesoscale structures that form. The model benefits from diffusion coefficients of the principal elements through the native oxides predicted by using molecular simulations. Through our examination of the oxidation behavior as a function of the alloy composition, we corroborated that the oxide scale growth is a function of the complex chemistry and resultant microstructures. The effect of heat treatment on these alloys is also simulated by using reconstructed experimental micrographs. When they are in a single-crystal structure, no segregation is noted for α-Al₂O₃ and Cr₂O₃, which are the primary scale-forming oxides. However, a coexistent separation between Al₂O₃ and Cr₂O₃ oxide scales with the Al-Ni- and Cr-Fe-rich regions is predicted when phase-separated microstructures are incorporated into the model.     

Phase transition in evolution of traffic flow with scale-free property

This paper investigates the behaviour of traffic flow in traffic systems with a new model based on the NaSch model and cluster approximation of mean-field theory. The proposed model aims at constructing a mapping relationship between the microcosmic behaviour and the macroscopic property of traffic flow. Results demonstrate that scale-free phenomenon of the evolution network becomes obvious when the density value of traffic flow reaches at the critical point of phase transition from free flow to traffic congestion, and jamming is limited in this scale-free structure.     

Car Deceleration Considering Its Own Velocity in Cellular Automata Model

In this paper, we propose a new cellular automaton model, which is based on NaSch traffic model. In our method, when a car has a larger velocity, if the gap between the car and its leading car is not enough large, it will decrease. The aim is that the following car has a buffer space to decrease its velocity at the next time, and then avoid to decelerate too high. The simulation results show that using our model, the car deceleration is realistic, and is closer to the field measure than that of NaSch model.     

Noise-Induced Phase Transition in Traffic Flow

One of the dynamic phases of the traffic flow is the traffic jam. It appears in traffic flow when the vehicledensity is larger than the critical value. In this paper, a new method is presented to investigate the traffic jam when thevehicle density is smaller than the critical value. In our method, we introduce noise into the traffic system after sufficienttransient time. Under the effect of noise, the traffic jam appears, and the phase transition from tree to synchronized flowoccurs in traffic flow. Our method is tested for the deterministic NaSch traffic model. The simulation results demonstratethat there exist a broad range of lower densities at which the noise effect leading to traffic jam can be observed.     

细胞自动机位相展开算法用于三维传感

研究了细胞自动机算法用于复杂面形三维传感问题。提出采用调制度分析的方法构造二元控制模板，以确保细胞自动机算法能展开复杂位相场。给出了采用这种方法对口腔牙型测量的结果。     

Analysis of Phase Transition in Traffic Flow based on a New Model of Driving Decision

Different driving decisions will cause different processes of phase transition in traffic flow.To reveal the inner mechanism, this paper built a new cellular automaton (CA) model,based on the driving decision (DD). In the DD model, a driver's decision is divided intothree stages: decision-making, action, and result. The acceleration is taken as a decisionvariable and three core factors, i.e. distance between adjacent vehicles, their own velocity,and the preceding vehicle's velocity, are considered. Simulation results show that the DDmodel can simulate the synchronized flow effectively and describe the phase transitionin traffic flow well. Further analyses illustrate that various density will cause the phasetransition and the random probability will impact the process. Compared with the traditional NaSch model, the DD model considered the preceding vehicle's velocity, the deceleration limitation, and a safe
distance, so it can depict closer to the driver preferences on pursuing safety, stability and fuel-saving and has strong theoreticalinnovation for future studies.     

A New Class of Cellular Automata with a Discontinuous Glass Transition

We introduce a new class of two-dimensional cellular automata with a bootstrap percolation-like dynamics. Each site can be either empty or occupied by a single particle and the dynamics follows a deterministic updating rule at discrete times which allows only emptying sites. We prove that the threshold density ρ _c for convergence to a completely empty configuration is non trivial, 0<ρ _c <1, contrary to standard bootstrap percolation. Furthermore we prove that in the subcritical regime, ρ<ρ _c , emptying always occurs exponentially fast and that ρ _c coincides with the critical density for two-dimensional oriented site percolation on ℤ². This is known to occur also for some cellular automata with oriented rules for which the transition is continuous in the value of the asymptotic density and the crossover length determining finite size effects diverges as a power law when the critical density is approached from below. Instead for our model we prove that the transition is discontinuous and at the same time the crossover length diverges faster than any power law. The proofs of the discontinuity and the lower bound on the crossover length use a conjecture on the critical behaviour for oriented percolation. The latter is supported by several numerical simulations and by analytical (though non rigorous) works through renormalization techniques. Finally, we will discuss why, due to the peculiar mixed critical/first order character of this transition, the model is particularly relevant to study glassy and jamming transitions. Indeed, we will show that it leads to a dynamical glass transition for a Kinetically Constrained Spin Model. Most of the results that we present are the rigorous proofs of physical arguments developed in a joint work with D.S. Fisher.