Searcharxiv⌕ Search

arXiv · 2610.32290

Regret-Based Max-Pressure Traffic Signal Control under Uncertain Traffic States

Abstract

Max-pressure (MP) traffic signal control selects phases using pressure scores computed from estimated traffic states, but these states are uncertain and their consequences depend on whether they alter phase ranking and how much pressure is lost. This paper develops a decision-oriented Regret-Based Max-Pressure framework that represents uncertainty through phase-selection regret, defined as the pressure loss of a candidate phase relative to the pressure-maximizing phase under each plausible latent state. We propose Stochastic Regret MP, which minimizes expected regret under a calibrated residual distribution, and Distributionally Robust (DR) Regret MP, which minimizes worst-case expected regret over a Wasserstein ambiguity set. Robustifying regret rather than absolute pressure makes the formulation invariant to state-dependent pressure components shared by all candidate phases, thereby focusing robustness on relative phase quality. We further derive an explicit queue-linear pressure-loss bound and establish strong queue stability when the net-service reserve exceeds the resulting loss coefficient. Numerical experiments show that both methods reduce normalized true-state pressure regret by about 70% relative to Point-estimate MP, while DR Regret MP yields lower network queues than direct robustification of absolute pressure. In microscopic SUMO experiments on a 28-intersection real-world network, Stochastic Regret MP and DR Regret MP reduce mean delay by 18.9% and 14.9%, respectively, and retain benefits under detector undercount and failure. The results show that representing uncertainty through its decision consequences can improve reliable traffic control under imperfect state information.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chaopeng Tan, Qiongdan Hu, Meng Wang. 2026-10-23. Regret-Based Max-Pressure Traffic Signal Control under Uncertain Traffic States. https://arxiv.org/abs/2610.32290

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

KEEP EXPLORING

Related papers

Reinforcement Learning based Traffic Signal Control for Queue Minimization: From Lane-based to Laneless Traffic

Efficient traffic signal control (TSC) is essential for reducing congestion and delays. Traditional TSC methods struggle to capture the dynamics of laneless, heterogeneous traffic. We propose a reinforcement learning (RL) based adaptive TSC framework whose reward depends only on approach-level queue length, motivated by the difficulty of obtaining per-vehicle measurements in laneless traffic, and evaluate it using SUMO on a conventional lane-based, homogeneous (LBHO) intersection and on a non-orthogonal laneless, heterogeneous (LLHE) intersection. On the LBHO site, the lowest mean configuration has about 23\% lower mean queue length than a Dynamic Webster baseline, and the unselected Full-State configuration about 15\% lower. On the LLHE site, all RL configurations have 66-73\% lower mean queue length than a Dynamic Webster baseline under nominal demand, and 63--74\% lower under two higher-demand scenarios evaluated without retraining. Our algorithm also outperforms actuated control and a RESCO-DQN baseline on mean queue length. We additionally release a laneless, heterogeneous-vehicle SUMO framework integrated with RL based signal control, to our knowledge the first such open implementation on a current SUMO version.

eess.SY↗

A Deep State-Space Model Compression Method using Upper Bound on Output Error

We study deep state-space models (Deep SSMs) that contain linear quadratic-output (LQO) systems as internal blocks and present a compression method with a provable output error guarantee. We first derive an upper bound on the output error between two Deep SSMs and show that the bound can be expressed in terms of the $h^2$-error norms between the layerwise LQO systems. In particular, we show that reducing the $h^2$ approximation errors of the LQO systems placed in shallow layers is effective in reducing the derived upper bound on the output error. Next, we formulate an optimization problem for the derived upper bound and develop a gradient-based MOR method. In the numerical experiments, using the IMDb task from the LRA benchmark, we demonstrate the effectiveness of the proposed upper-bound-based compression method. In particular, we show that the number of trainable parameters can be reduced by approximately 60\% without retraining while maintaining the performance of the original model.

eess.SY↗

Safe Navigation in Cluttered Environments Via Spline-Based Harmonic Potential Fields

We provide a motion-planning framework for target reaching and obstacle avoidance in cluttered environments. Given a polyhedral decomposition of the feasible space, the agent is guided through a prescribed sequence of cells by a suitable control policy. For each cell, we construct a potential induced by a harmonic function on the unit disk whose Dirichlet boundary condition is represented by a cardinal B-spline curve. A detailed analysis of the curve periodicity, support, and control-point selection provides an explicit analytical construction of these potentials and the associated vector fields. We further characterize inter-cell control continuity and forward invariance of non-exit facets, and introduce a smoothed control law ensuring continuous switching between independently constructed neighboring cells. Numerical results illustrate that the resulting framework safely guides the agent along the prescribed cell sequence from the initial point to the target.

eess.SY↗