HD-RMPC: A Hierarchical Distributed and Robust Model Predictive Control Framework for Urban Traffic Signal Timing
Bibliographic record
Abstract
Due to the nonlinearity and dynamics of transportation systems, traffic signal control (TSC) in urban traffic networks has always been an important challenge. In recent years, model predictive control (MPC) has shown extraordinary potential in TSC due to its outstanding ability to model dynamic systems. However, the relatively complex online computing, lack of reasonable setpoints for target solving, and uncertainty of traffic network hinder MPC from being further applied. To address these problems, we propose a hierarchical, distributed, and robust model predictive control (HD-RMPC) framework for urban TSC. At the slow-update layer, the road network is dynamically divided into several subareas according to regional attributes and real-time traffic demand. Meanwhile, the volume is coordinated in a robust way for the purpose of traffic equilibrium and overflow prevention. Then, the set-point matrix of each subarea is calculated to equalize the flow in the subarea. This distributed framework guarantees the real-time performance of MPC in urban traffic networks. At the fast-update layer, we adopt an improved prediction model by explicit modeling of the disturbance and reduce the prediction error. Finally, the objective function is reconstructed and solved at the control layer to obtain the optimal control law. Through continuous and asynchronous optimization of the set point and prediction model, the framework significantly improves the control effect. Simulation evaluation based on a real-world road network demonstrates that the proposed HD-RMPC method outperforms all baselines and maintains excellent real-time performance.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".