相关论文: Traffic lights, clumping and QBDs

Lower and upper bounds are explored for the uniform (Kolmogorov) and $L^2$-distances between the distributions of weighted sums of dependent summands and the normal law. The results are illustrated for several classes of random variables…

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 in fixed-time scheme controls the traffic flow. Open boundary condition is…

This paper explores a conditional Gibbs theorem for a random walkinduced by i.i.d. (X_{1},..,X_{n}) conditioned on an extreme deviation of its sum (S_{1}^{n}=na_{n}) or (S_{1}^{n}>na_{n}) where a_{n}\rightarrow\infty. It is proved that when…

We study the performance of random linear network coding for time division duplexing channels with Poisson arrivals. We model the system as a bulk-service queue with variable bulk size. A full characterization for random linear network…

We present data from several German freeways showing different kinds of congested traffic forming near road inhomogeneities, specifically lane closings, intersections, or uphill gradients. The states are localized or extended, homogeneous…

A two-dimensional cellular automaton is introduced to model the flow and jamming of vehicular traffic in cities. Each site of the automaton represents a crossing where a finite number of cars can wait approaching the crossing from each of…

This paper extends our previous work in [1],[2], on optimal scheduling of autonomous vehicle arrivals at intersections, from one to a grid of intersections. A scalable distributed Mixed Integer Linear Program (MILP) is devised that solves…

In this paper, we prove a conditional limit theorem for independent not necessarily identically distributed random variables. Namely, we obtain the asymptotic distribution of a large number of them given the sum.

In the Page parking (or packing) model on a discrete interval (also known as the discrete R{\'e}nyi packing problem or the unfriendly seating problem), cars of length two successively park uniformly at random on pairs of adjacent places,…

Exact mean field equations are derived analytically to give the fundamental diagrams, i.e., the average speed - car density relations, for the Fukui-Ishibashi one-dimensional traffic flow cellular automaton model of high speed vehicles…

The following geometric vehicle scheduling problem has been considered: given continuous curves $f_1, \ldots, f_n : \mathbb{R} \rightarrow \mathbb{R}^2$, find non-negative delays $t_1, \ldots, t_n$ minimizing $\max \{ t_1, \ldots, t_n \}$…

We study local features, and provide a topological insight into the global structure of the probability density distribution and of the pattern of the optimal paths for large rare fluctuations away from a stable state. In contrast to…

In the classical parking problem, unit intervals ("car lengths") are placed uniformly at random without overlapping. The process terminates at saturation, i.e. until no more unit intervals can be stowed. In this paper, we present a…

This paper considers the problem of coordinating the vehicular traffic at an intersection and on the branches leading to it for minimizing a combination of total travel time and energy consumption. We propose a provably safe…

We introduce and study several random combinatorial billiard trajectories. Such a system, which depends on a fixed parameter $p\in(0,1)$, models a beam of light that travels in a Euclidean space, occasionally randomly reflecting off of a…

This paper addresses the problem of a boundary control design for traffic evolving in a large-scale urban network. The traffic state is described on a macroscopic scale and corresponds to the vehicle density, whose dynamics are governed by…

We show an asymptotic estimate for the number of labelled planar graphs on $n$ vertices. We also find limit laws for the number of edges, the number of connected components, and other parameters in random planar graphs.

We study the distance between the two rightmost particles in branching Brownian motion. Derrida and the second author have shown that the long-time limit $d_{12}$ of this random variable can be expressed in terms of PDEs related to the…

In heavy traffic with congested roadway the maximum traffic flow also depends on length of cars. This is deduced in a simple derivation suited for classroom demonstration as well as homework. The resulting equation demonstrates a new…

Motivated by the statistical analysis of the discrete optimal transport problem, we prove distributional limits for the solutions of linear programs with random constraints. Such limits were first obtained by Klatt, Munk, & Zemel (2022),…