Improving the Urban Transport System Resilience Through Adaptive Traffic Signal Control Enabled by Decentralised Multiagent Reinforcement Learning
Bibliographic record
Abstract
The principle of system resilience is its ability to withstand disruptions and maintain an equilibrium state. In urban network systems, adaptive traffic signal control (ATSC) has been an effective countermeasure to mitigate traffic flow disturbance and improve resilience. This research has explored the usage of a decentralised advantage actor‐critic (a2c) algorithm‐based ATSC in mitigating disruptions, particularly nonrecurring congestion caused by car accidents. A reward function has also been proposed, combining deduced resilience metric, safety indicator time to collision (TTC) and system performance. A virtual simulation environment was created using simulation of urban mobility (SUMO) to facilitate the evaluation of the proposed approach. In the grid simulation environment, an overall 5.8% improvement is achieved, exceeding benchmark algorithms in three metrics, especially performance with a margin of over 5.2%. Robustness against different levels of car accidents are proven as well. Further evaluation is also implemented based on a real‐world case study and demonstrates an improvement of 20.08%, highlighting the correlation of proposed method’s efficiency on the traffic flow rate and road structure.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".