Green Wave Arterial Cooperative Control Strategy Based on Through-Traffic Priority
Bibliographic record
Abstract
Mainline coordinated control is usually based on fixed speed and statistical traffic flow by period. However, in actual operation, the vehicles parked in front of the intersection and the arriving vehicles often fluctuate, and the through-traffic green time is wasted due to phase transition, which leads to mismatches between the signal plans and actual traffic flow requirements, affecting the traffic efficiency of the intersection. To address the above issues, using vehicle–road collaborative control (VRCC), by calculating the phase difference lead time and phase difference of adjacent intersections, the green extension time for the green wave through-traffic phase, and the guiding vehicle speed, the goal of reducing the detention volume of through traffic, reducing the waste of through-traffic green time caused by phase transitions and improving the throughput of through traffic can be achieved. The speed of the green wave traffic flow is increased by guiding vehicles to form saturated platoons during green periods. Finally, PTV VISSIM 4.3 was used for simulation verification, and the results showed that compared to not implementing the control strategy, the average delay on the arterial road was reduced by 85.1%, the average number of stops was reduced by 84.3%, the average travel time was reduced by 34%, and the average queue length was reduced by 62.6%. This significantly improved the efficiency of traffic on the arterial road and effectively reduced congestion.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| 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".