Pith. sign in

REVIEW 1 cited by

Computation Load Balancing Real-Time Model Predictive Control in Urban Traffic Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1811.03846 v1 pith:BYVPCT4J submitted 2018-11-09 cs.SY cs.SY

classification cs.SY
keywords controltrafficapproachonlinecomputationmodelurbanactive
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Owing to the rapid growth number of vehicles, urban traffic congestion has become more and more severe in the last decades. As an effective approach, Model Predictive Control (MPC) has been applied to urban traffic signal control system. However, the potentially high online computation burden may limit its further application for real scenarios. In this paper, a new approach based on online active set strategy is proposed to improve the real-time performance of MPC-based traffic controller by reducing the online computing time. This approach divides one control cycle into several sequential sampling intervals. In each interval, online active set method is applied to solve quadratic programming (QP) of traffic signal control model, by searching the optimal solution starting at the optimal solution of previous interval in the feasible region. The most appealing property of this approach lies in that it can distribute the computational complexity into several sample intervals, instead of imposing heavy computation burden at each end of control cycle. The simulation experiments show that this breakthrough approach can obviously reduce the online computational complexity, and increase the applicability of the MPC in real-life traffic networks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. The Origin of Self-Attention: Pairwise Affinity Matrices in Feature Selection and the Emergence of Self-Attention

    cs.LG 2025-07 conditional novelty 3.0 of 10

    Self-attention is reframed as a single-hop special case of Infinite Feature Selection's affinity-based propagation.

Pith tools