Search arXiv⌕ Search

arXiv · 2609.35152

Coordinated Lane-Level Variable Speed Limits and Ramp Metering for Successive Weaving Segments Considering Merging/Diverging Risks: A Hybrid Model Predictive Control and Multi-Agent Reinforcement Learning Approach

Abstract

Successive weaving segments (SWSs) on urban expressways are bottlenecks prone to recurrent congestion and collisions, requiring fine-grained active traffic management (ATM). Existing approaches struggle to balance the adaptive performance of data-driven optimization with the resilience and transferability of model-based control. We propose a hybrid framework to coordinate lane-level variable speed limits (VSLs) and ramp metering across SWSs. First, we reconstruct L-METANET, a lane-level macroscopic traffic flow model that captures free and forced lane changes. Second, we combine XGBoost-SHAP with a random-parameters binary logit (RPBL) model to derive analytical equations for merging and diverging collision risks and formulate system cost and reward functions. Third, we develop MPC-STMAPPO, a hierarchical controller integrating model predictive control (MPC) and multi-agent reinforcement learning (MARL). Its upper MPC layer uses L-METANET for long-horizon rolling optimization and generates baseline commands; its lower spatiotemporal MAPPO (ST-MAPPO) layer, enhanced with Mamba cells and graph attention, produces residual actions for short-horizon adjustment. Real-world experiments on the 18-km Eastern Expressway in Changchun, China, show that L-METANET accurately reproduces lane-changing-induced flow redistribution and capacity drops, with state evolution aligned with ground truth. XGBoost-SHAP-RPBL achieves AUCs above 0.80 in most tasks, outperforming conventional logit models. MPC-STMAPPO converges faster and performs better across multiple metrics than MPC- and MARL-based baselines. Under randomly fluctuating demand, it also significantly outperforms pure MARL in generalization, demonstrating strong potential for industrial deployment.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Guodong Ma, Baofeng Sun, Wenyu Yang, Zhihong Yao. 2026-09-28. Coordinated Lane-Level Variable Speed Limits and Ramp Metering for Successive Weaving Segments Considering Merging/Diverging Risks: A Hybrid Model Predictive Control and Multi-Agent Reinforcement Learning Approach. https://arxiv.org/abs/2609.35152

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

KEEP EXPLORING

Related papers

A Single-loop Stochastic Riemannian ADMM for Nonsmooth Composite Optimization

We study a class of nonsmooth composite stochastic optimization on Riemannian manifolds, where the objective is the sum of an expectation function and a nonsmooth regularizer. These types of problems appear widely in various application fields, such as machine learning. Although operator-splitting methods naturally exploit this separable structure, existing Riemannian variants primarily target deterministic problems, and stochastic extensions are limited to more restrictive settings. In this work, we propose a momentum-based adaptive Riemannian stochastic alternating direction method of multipliers (MARS-ADMM), which combines a recursive variance-reduced estimator for the expectation component with a prediction-correction update for the nonsmooth block. This yields a single-loop algorithm requiring only two proximal updates, one Riemannian gradient evaluation, and $\mathcal{O}(1)$ stochastic gradient samples per iteration. Under standard assumptions, we prove that MARS-ADMM attains an $ε$-KKT point with an oracle complexity of $\mathcal{O}(ε^{-3})$, improving upon the previously best-known rate of $\widetilde{\mathcal{O}}(ε^{-3.5})$ for stochastic Riemannian primal-dual methods. This complexity also matches the best-known bounds in deterministic nonsmooth Riemannian optimization, demonstrating that deterministic-level accuracy can be achieved using only constant-size stochastic samples. Numerical experiments on two types of test problems reveal promising performances of the proposed algorithm. To the best of our knowledge, MARS-ADMM is the first stochastic Riemannian ADMM with provable optimal complexity guarantees.

math.OC↗

Convergence analysis of dynamical systems for optimization by an improved Lyapunov framework

We study the convergence analysis of continuous-time dynamical systems associated with optimization methods for strongly convex functions. Recent works have proposed systematic constructions of Lyapunov functions for such analysis, while also revealing limitations of the Lyapunov analysis. Aujol--Dossal--Rondepierre (2023) have proposed a technique to address this issue by reorganizing Lyapunov functions so as to evaluate a quantity $f(x(t)) - f_* - g(t)\|x(t)-x_*\|^2$ rather than $f(x(t)) - f_*$. By combining this technique with our computer-assisted framework to discover Lyapunov functions, we develop an improved method that reproduces an existing convergence rate or yields better rates than previous studies.

math.OC↗

Mean Field Games and Control on Large Expander Graphs

This paper investigates mean field games on sparse networks. In the case of large expander graphs, the limit topologies are analyzed using the graphexon framework, which characterizes sparse connections. We prove that the associated sequence of discrete averaging operators converges strongly to a continuous operator and this is illustrated in the development of infinite limits of Gabber-Galil-Margulis expander graphs \cite{gabber1981explicit}. These properties enable the formulation and existence proof of equilibria for linear-quadratic mean field games in which each agent is identified by a spatial network label $α\in X$ and only interacts with the neighborhood average characterized by the operator $\mathcal{G}$, i.e., the average state of a limited number of connected neighbors in a large expander graph. Furthermore, algebraic conditions induced by the spectral gap of $\mathcal{G}$ for the global asymptotic stability of the closed-loop system are established, and parameter thresholds that give rise to a Turing-type topological instability are established.

math.OC↗