arXiv subjects

Michael Schreckenberg

Publications and source records attributed to Michael Schreckenberg.

50 records · Page 3Linked to original sources

arXiv2002

Single-vehicle data of highway traffic: microscopic description of traffic phases

We present a detailed analysis of single-vehicle data which sheds some light on the microscopic interaction of the vehicles. Besides the analysis of free flow and synchronized traffic the data sets especially provide information about wide jams which persist for a long time. The data have been collected at a location far away from ramps and in the absence of speed limits which allows a comparison with idealized traffic simulations. We also resolve some open questions concerning the time-headway distribution.

cond-mat.stat-mech↗

arXiv2002

Comment on `Garden of Eden states in traffic model revisited'

Recently, Huang and Lin suggested a combination of two successfull mean-field theories, the 2-cluster approximation and paradisical mean-field, for the Nagel-Schreckenberg cellular automaton model of traffic flow. We argue that this new approximation is inconsistent since it violates the Kolmogorov conditions.

cond-mat.stat-mech↗

arXiv2001

Optimizing Traffic Lights in a Cellular Automaton Model for City Traffic

We study the impact of global traffic light control strategies in a recently proposed cellular automaton model for vehicular traffic in city networks. The model combines basic ideas of the Biham-Middleton-Levine model for city traffic and the Nagel-Schreckenberg model for highway traffic. The city network has a simple square lattice geometry. All streets and intersections are treated equally, i.e., there are no dominant streets. Starting from a simple synchronized strategy we show that the capacity of the network strongly depends on the cycle times of the traffic lights. Moreover we point out that the optimal time periods are determined by the geometric characteristics of the network, i.e., the distance between the intersections. In the case of synchronized traffic lights the derivation of the optimal cycle times in the network can be reduced to a simpler problem, the flow optimization of a single street with one traffic light operating as a bottleneck. In order to obtain an enhanced throughput in the model improved global strategies are tested, e.g., green wave and random switching strategies, which lead to surprising results.

cond-mat.stat-mech↗

arXiv2001

Human behavior as origin of traffic phases

It is shown that the desire for smooth and comfortable driving is directly responsible for the occurrence of complex spatio-temporal structures (``synchronized traffic'') in highway traffic. This desire goes beyond the avoidance of accidents which so far has been the main focus of microscopic modeling and which is mainly responsible for the other two phases observed empirically, free flow and wide moving jams. These features have been incorporated into a microscopic model based on stochastic cellular automata and the results of computer simulations are compared with empirical data. The simple structure of the model allows for very fast implementations of realistic networks. The level of agreement with the empirical findings opens new perspectives for reliable traffic forecasts.

cond-mat.stat-mech↗

arXiv2001

A Microscopic Model for Packet Transport in the Internet

A microscopic description of packet transport in the Internet by using a simple cellular automaton model is presented. A generalised exclusion process is introduced which allows to study travel times of the particles ('data packets') along a fixed path in the network. Computer simulations reveal the appearance of a free flow and a jammed phase separated by a (critical) transition regime. The power spectra are compared to empirical data for the RTT (Round Trip Time) obtained from measurements in the Internet. We find that the model is able to reproduce the characteristic statistical behaviour in agreement with the empirical data for both phases (free flow and congested). The phases are therefore jamming properties and not related to the structure of the network. Moreover the model shows, as observed in reality, critical behaviour (1/f-noise) for paths with critical load.

cond-mat.stat-mech↗

arXiv2001

Random walk theory of jamming in a cellular automaton model for traffic flow

The jamming behavior of a single lane traffic model based on a cellular automaton approach is studied. Our investigations concentrate on the so-called VDR model which is a simple generalization of the well-known Nagel-Schreckenberg model. In the VDR model one finds a separation between a free flow phase and jammed vehicles. This phase separation allows to use random walk like arguments to predict the resolving probabilities and lifetimes of jam clusters or disturbances. These predictions are in good agreement with the results of computer simulations and even become exact for a special case of the model. Our findings allow a deeper insight into the dynamics of wide jams occuring in the model.

cond-mat.stat-mech↗

arXiv2000

Towards a realistic microscopic description of highway traffic

Simple cellular automata models are able to reproduce the basic properties of highway traffic. The comparison with empirical data for microscopic quantities requires a more detailed description of the elementary dynamics. Based on existing cellular automata models we propose an improved discrete model incorporating anticipation effects, reduced acceleration capabilities and an enhanced interaction horizon for braking. The modified model is able to reproduce the three phases (free-flow, synchronized, and stop-and-go) observed in real traffic. Furthermore we find a good agreement with detailed empirical single-vehicle data in all phases.

cond-mat.stat-mech↗

arXiv1999

Cellular Automata Simulating Experimental Properties of Traffic Flows

A model for 1D traffic flow is developed, which is discrete in space and time. Like the cellular automaton model by Nagel and Schreckenberg [J. Phys. I France 2, 2221 (1992)], it is simple, fast, and can describe stop-and-go traffic. Due to its relation to the optimal velocity model by Bando et al. [Phys. Rev. E 51, 1035 (1995)], its instability mechanism is of deterministic nature. The model can be easily calibrated to empirical data and displays the experimental features of traffic data recently reported by Kerner and Rehborn [Phys. Rev. E 53, R1297 (1996)].

cond-mat.stat-mech↗

arXiv1998

Disorder effects in cellular automata for two-lane traffic

For single-lane traffic models it is well known that particle disorder leads to platoon formation at low densities. Here we discuss the effect of slow cars in two-lane systems. Surprisingly, even a small number of slow cars can initiate the formation of platoons at low densities. The robustness of this phenomenon is investigated for different variants of the lane-changing rules as well as for different variants on the single-lane dynamics. It is shown that anticipation of drivers reduces the influence of slow cars drastically.

cond-mat.stat-mech↗

arXiv1998

Garden of Eden states in traffic models

We investigate the allowed configurations in the stationary state of the cellular automaton model for single-lane traffic. It is found that certain states in the configuration space can not be reached if one uses parallel dynamics. These so-called Garden of Eden (GoE) states do not exist for random-sequential dynamics and are responsible for the strong short-ranged correlations found in parallel dynamics. By eliminating the GoE states we obtain a simple and effective approximative description of the model. For $v_{max}=1$ the exact solution is recovered. For $v_{max}=2$ this elimination leads to much higher values of the flux compared to the mean-field result which are in good agreement with Monte Carlo simulations.

cond-mat.stat-mech↗

arXiv1997

Traffic flow models with 'slow-to-start' rules

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 (flow-density relationship) using the so-called car-oriented mean-field approach (COMF) which yields the exact solution of the basic model with $v_{max}=1$. Here we find that this is no longer true for the models with modified acceleration rules, but the results are still in good agreement with simulations. We also compare the effects of the two different slow-to-start rules and discuss their relevance for real traffic. In addition, in one of these models we find a new phase transition to a completely jammed state.

cond-mat.stat-mech↗

arXiv1996

Car-oriented mean-field theory for traffic flow models

We present a new analytical description of the cellular automaton model for single-lane traffic. In contrast to previous approaches we do not use the occupation number of sites as dynamical variable but rather the distance between consecutive cars. Therefore certain longer-ranged correlations are taken into account and even a mean-field approach yields non-trivial results. In fact for the model with $v_{max}=1$ the exact solution is reproduced. For $v_{max}=2$ the fundamental diagram shows a good agreement with results from simulations.

cond-mat.stat-mech↗

arXiv1995

Two Lane Traffic Simulations using Cellular Automata

We examine a simple two lane cellular automaton based upon the single lane CA introduced by Nagel and Schreckenberg. We point out important parameters defining the shape of the fundamental diagram. Moreover we investigate the importance of stochastic elements with respect to real life traffic.

cond-mat↗

arXiv1995

Cellular Automata For Traffic Flow: Analytical Results

We use analytical methods to investigate cellular automata for traffic flow. Two different mean-field approaches are presented, which we call site-oriented and car-oriented, respectively. The car-oriented mean-field theory yields the exact fundamental diagram for the model with maximum velocity $\vm =1$ whereas in the site-oriented approach one has to take into account correlations between nearest-neighbour sites. Going beyond mean-field using the so-called $n$-cluster approach our results for $\vm >1$ are in excellent agreement with numerical simulations. We also present a modified cellular automaton which is closely related to a two-dimensional dimer model.

cond-mat↗