Skip to main content
Article
100%
HD

How many times have you sat at a red light while the lane next to you was empty? It's the classic urban traffic paradox: traditional traffic lights look at the road as a whole, ignoring that cars distribute differently between the overtaking lane and the regular lane. A fresh study on arXiv changes the game. Researchers built a "two-lane" model that simulates vehicle flow with unprecedented granularity: each lane has its own density, speed, and life.

On this base, they grafted a distributed Model Predictive Control (MPC) solved with the ADMM algorithm: in practice, each intersection calculates its own optimal green times by exchanging only essential info with neighbors, without a central brain that would slow everything down. The cherry on top is a data-driven module that predicts in real-time how many drivers will change lanes ("split ratios"), making the system as reactive as an expert driver.

Tested in VISSIM simulation on a real six-intersection network in Dalian, China, the system beat classic strategies for both traffic flow and computation speed. Result: shorter queues, less waiting, and an architecture ready for real-world deployment. The smart city is no longer a promise; it's becoming code running on controllers at the roadside.

Bonus
100%
HD

The core innovation lies in spatial discretization: the classic LWR (Lighthill-Whitham-Richards) model treats the road as a single pipe. Here, authors extend the framework to two coupled pipes via source terms modeling lane-changing. The continuity equation for each lane i becomes βˆ‚Ο_i/βˆ‚t + βˆ‚q_i(ρ_i)/βˆ‚x = s_i, where s_i represents the net flow of vehicles entering/exiting lane i.

The distributed MPC control minimizes a local cost function (weighted sum of queues) subject to capacity and min/max green time constraints. ADMM (Alternating Direction Method of Multipliers) decomposes the global problem into per-intersection subproblems, coordinated by dual variables associated with boundary flows. Convergence is guaranteed by convexity of the relaxed problem.

The estimation of split ratios Ξ»_i(t) (fraction of flow turning right/left/through per lane) uses a data-driven approach: an LSTM network trained on historical loop-detector data predicts Ξ»_i(t+k|t) for the MPC prediction horizon. This avoids the stationary assumption typical of SCATS/SCOOT controls. VISSIM validation on a real Dalian network (6 intersections, 12 approaches, 24 lanes) shows an 18% reduction in average travel time and 35% fewer stops compared to offline-optimized Webster, with computation time per step < 100 ms on edge hardware, compatible with 1-5 second control cycles.

Ask AI

Explore key aspects of this story with 3 quick insights

Source

Date Published:
Original Article arxiv.org
Fact-check verified on 31/08/2026 Primary Study / Original Source
Read our Editorial Guidelines & AI Ethics Policy
Creative Commons License CC BY-NC-SA 4.0

Keep exploring

Discover the full archive of science bites or head back to home

Riconnessione al server... Aggiornamento della sessione in corso
Connessione interrotta Impossibile stabilire il collegamento
Sessione aggiornata Ricarica per visualizzare i contenuti