Searcharxiv⌕ Search

arXiv · 2610.32280

Decision Timescales in Max-Pressure Traffic Signal Control: Theory, Methodology, and Validation

Abstract

Max-pressure (MP) control adapts signal phases to prevailing traffic states, but its decision timescale is typically fixed a priori. This paper treats the decision timescale as an explicit dimension of MP control. We first characterize the trade-off between responsiveness and switching efficiency by quantifying how an equivalent switching loss reduces service capacity over a finite decision interval. This yields a load-dependent critical timescale determined by switching loss and normalized traffic load, together with a performance-oriented operating range above the stability boundary. Building on this result, we propose Variable-Timescale Max-Pressure (VT-MP), in which each intersection selects its decision interval according to local operating conditions, allowing the control timescale to vary across time and space. We establish strong stability of the resulting asynchronous heterogeneous controller under uniformly admissible local loads and bounded decision intervals, and introduce a downstream receiving-supply correction for finite-storage implementation. Three experiments provide mechanism validation and network-level evaluation. A single-intersection experiment confirms that the preferred decision interval increases systematically with traffic load and follows the derived characteristic timescales. In a store-and-forward network, heterogeneous VT-MP reduces total queueing time by 31.0% relative to the best fixed-interval benchmark. In a microscopic 5x5 SUMO network, it reduces mean trip delay by 24.3%, from 213.3 s to 161.5 s, and peak network accumulation by 12.3%. These findings show that the MP decision timescale should be treated as a traffic-state-dependent control variable rather than a fixed implementation parameter.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chaopeng Tan. 2026-10-23. Decision Timescales in Max-Pressure Traffic Signal Control: Theory, Methodology, and Validation. https://arxiv.org/abs/2610.32280

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↗