Related papers: Ergodic properties of a simple deterministic traff…
The equation of motion of a general class of macroscopic traffic flow models is linearized around a steady uniform flow. A closed-form solution of a boundary-initial value problem is obtained, and it is used to describe several phenomena.…
Structures such as waves, jets, and vortices have a dramatic impact on the transport properties of a flow. Passive tracer transport in incompressible two-dimensional flows is described by Hamiltonian dynamics, and, for idealized structures,…
A system of identical cars on a single-lane road is treated as a microcanonical and canonical ensemble. Behaviour of the cars is characterized by the probability of car velocity as a function of distance and velocity of the car ahead. The…
We analyze the steady-state flow as a function of the initial density for a class of deterministic cellular automata rules (``traffic rules'') with periodic boundary conditions [H. Fuks and N. Boccara, Int. J. Mod. Phys. C 9, 1 (1998)]. We…
We study kinetic models for traffic flow characterized by the property of producing backward propagating waves. These waves may be identified with the phenomenon of stop-and-go waves typically observed on highways. In particular, a refined…
We propose a traffic flow model in which the vehicles are filed from their maximal velocities, the fast cars run with $Vmax{1}$, whereas the slow ones run with $Vmax{2}$. Using new overtaking rules which deals with deterministic NaSch…
We investigate a probabilistic cellular automaton model which has been introduced recently. This model describes single-lane traffic flow on a ring and generalizes the asymmetric exclusion process models. We study the equilibrium properties…
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…
We study a simple aggregation model that mimics the clustering of traffic on a one-lane roadway. In this model, each ``car'' moves ballistically at its initial velocity until it overtakes the preceding car or cluster. After this encounter,…
In this work we extend a recent kinetic traffic model to the case of more than one class of vehicles, each of which is characterized by few different microscopic features. We consider a Boltzmann-like framework with only binary…
A simple periodically driven system displaying rich behavior is introduced and studied. The system self-organizes into a mosaic of static ordered regions with three possible patterns, which are threaded by one-dimensional paths on which a…
We introduce a cycle-expansion (fully deterministic) technique to compute the asymptotic behavior of arbitrary order transport moments. The theory is applied to different kinds of one-dimensional intermittent maps, and Lorentz gas with…
We study the transport properties of passive inertial particles in a $2-d$ incompressible flows. Here the particle dynamics is represented by the $4-d$ dissipative embedding map of $2-d$ area-preserving standard map which models the…
Classical particles driven through periodically modulated potential energy landscapes are predicted to follow a Devil's staircase hierarchy of commensurate trajectories depending on the orientation of the driving force. Recent experiments…
Designing continuous trajectories whose time-averaged occupancy provably matches a prescribed spatial density (the \emph{ergodic coverage} problem) is central to UAV-assisted data collection and sensing, robotic exploration, and mobile…
We revisit the classic problem of determining optimal routes in a graph for transporting two given distributions defined on its nodes, originally studied by Wardrop and Beckmann in the 1950s. The global congestion profile at any given time…
For many power-limited networks, such as wireless sensor networks and mobile ad hoc networks, maximizing the network lifetime is the first concern in the related designing and maintaining activities. We study the network lifetime from the…
We study a simple swarming model on a two-dimensional lattice where the self-propelled particles exhibit a tendency to align ferromagnetically. Volume exclusion effects are present: particles can only hop to a neighboring node if the node…