No Arabic abstract
We study two perpendicular intersecting flows of pedestrians. The latter are represented either by moving hard core particles of two types, eastbound ($symbp$) and northbound ($symbm$), or by two density fields, $rhop_t(brr)$ and $rhom_t(brr)$. Each flow takes place on a lattice strip of width $M$ so that the intersection is an $Mtimes M$ square. We investigate the spontaneous formation, observed experimentally and in simulations, of a diagonal pattern of stripes in which alternatingly one of the two particle types dominates. By a linear stability analysis of the field equations we show how this pattern formation comes about. We focus on the observation, reported recently, that the striped pattern actually consists of chevrons rather than straight lines. We demonstrate that this `chevron effect occurs both in particle simulations with various different update schemes and in field simulations. We quantify the effect in terms of the chevron angle $Deltatheta_0$ and determine its dependency on the parameters governing the boundary conditions.
A one-way {em street} of width M is modeled as a set of M parallel one-dimensional TASEPs. The intersection of two perpendicular streets is a square lattice of size M times M. We consider hard core particles entering each street with an injection probability alpha. On the intersection square the hard core exclusion creates a many-body problem of strongly interacting TASEPs and we study the collective dynamics that arises. We construct an efficient algorithm that allows for the simulation of streets of infinite length, which have sharply defined critical jamming points. The algorithm employs the `frozen shuffle update, in which the randomly arriving particles have fully deterministic bulk dynamics. High precision simulations for street widths up to M=24 show that when alpha increases, there occur jamming transitions at a sequence of M critical values alphaM,M < alphaM,M-1 < ... < alphaM,1. As M grows, the principal transition point alphaM,M decreases roughly as sim 1/(log M) in the range of M values studied. We show that a suitable order parameter is provided by a reflection coefficient associated with the particle current in each TASEP.
We present results on the modeling of on- and off-ramps in cellular automata for traffic flow, especially the Nagel-Schreckenberg model. We study two different types of on-ramps that cause qualitatively the same effects. In a certain density regime one observes plateau formation in the fundamental diagram. The plateau value depends on the input-rate of cars at the on-ramp. The on-ramp acts as a local perturbation that separates the system into two regimes: A regime of free flow and another one where only jammed states exist. This phase separation is the reason for the plateau formation and implies a behaviour analogous to that of stationary defects. This analogy allows to perform very fast simulations of complex traffic networks with a large number of on- and off-ramps because one can parametrise on-ramps in an exceedingly easy way.
Off-diagonal profiles of local densities (e.g. order parameter or energy density) are calculated at the bulk critical point, by conformal methods, for different types of boundary conditions (free, fixed and mixed). Such profiles, which are defined by a non-vanishing matrix element of the appropriate operator between the ground state and the corresponding lowest excited state of the strip Hamiltonian, enter into the expression of two-point correlation functions on a strip. They are of interest in the finite-size scaling study of bulk and surface critical behaviour since they allow the elimination of regular contributions. The conformal profiles, which are obtained through a conformal transformation of the correlation functions from the half-plane to the strip, are in agreement with the results of a direct calculation, for the energy density of the two-dimensional Ising model.
We propose a model to implement and simulate different traffic-flow conditions in terms of quantum graphs hosting an ($N$+1)-level dot at each site, which allows us to keep track of the type and of the destination of each vehicle. By implementing proper Lindbladian local dissipators, we derive the master equations that describe the traffic flow in our system. To show the versatility and the reliability of our technique, we employ it to model different types of traffic flow (the symmetric three-way roundabout and the three-road intersection). Eventually, we successfully compare our predictions with results from classical models.
Currently, the visually impaired rely on either a sighted human, guide dog, or white cane to safely navigate. However, the training of guide dogs is extremely expensive, and canes cannot provide essential information regarding the color of traffic lights and direction of crosswalks. In this paper, we propose a deep learning based solution that provides information regarding the traffic light mode and the position of the zebra crossing. Previous solutions that utilize machine learning only provide one piece of information and are mostly binary: only detecting red or green lights. The proposed convolutional neural network, LYTNet, is designed for comprehensiveness, accuracy, and computational efficiency. LYTNet delivers both of the two most important pieces of information for the visually impaired to cross the road. We provide five classes of pedestrian traffic lights rather than the commonly seen three or four, and a direction vector representing the midline of the zebra crossing that is converted from the 2D image plane to real-world positions. We created our own dataset of pedestrian traffic lights containing over 5000 photos taken at hundreds of intersections in Shanghai. The experiments carried out achieve a classification accuracy of 94%, average angle error of 6.35 degrees, with a frame rate of 20 frames per second when testing the network on an iPhone 7 with additional post-processing steps.