Search arXivSearch

arXiv · 1310.2658

Control of a lane-drop bottleneck through variable speed limits

Abstract

In this study, we formulate the VSL control problem for the traffic system in a zone upstream to a lane-drop bottleneck based on two traffic flow models: the Lighthill-Whitham-Richards (LWR) model, which is an infinite-dimensional partial differential equation, and the link queue model, which is a finite-dimensional ordinary differential equation. In both models, the discharging flow-rate is determined by a recently developed model of capacity drop, and the upstream in-flux is regulated by the speed limit in the VSL zone. Since the link queue model approximates the LWR model and is much simpler, we first analyze the control problem and develop effective VSL strategies based on the former. First for an open-loop control system with a constant speed limit, we prove that a constant speed limit can introduce an uncongested equilibrium state, in addition to a congested one with capacity drop, but the congested equilibrium state is always exponentially stable. Then we apply a feedback proportional-integral (PI) controller to form a closed-loop control system, in which the congested equilibrium state and, therefore, capacity drop can be removed by the I-controller. Both analytical and numerical results show that, with appropriately chosen controller parameters, the closed-loop control system is stable, effect, and robust. Finally, we show that the VSL strategies based on I- and PI-controllers are also stable, effective, and robust for the LWR model. Since the properties of the control system are transferable between the two models, we establish a dual approach for studying the control problems of nonlinear traffic flow systems. We also confirm that the VSL strategy is effective only if capacity drop occurs. The obtained method and insights can be useful for future studies on other traffic control methods and implementations of VSL strategies.

Explore related subjects

Keep this discovery

BibTeXRIS

Hui-Yu Jin, Wen-Long Jin. 2013-10-09. Control of a lane-drop bottleneck through variable speed limits. https://arxiv.org/abs/1310.2658

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC