Boundary Guidance Strategy and Method for Urban Traffic Congestion Region Management in Internet of Vehicles Environment
Bibliographic record
Abstract
Accelerated urbanization has increased regional traffic congestion. To alleviate traffic congestion in a homogeneous road network, combined with the advantage of real-time traffic information obtained by the Internet of Vehicles (IoVs), a boundary guidance strategy for traffic congestion region is proposed. The strategy considers the optimal operation state of traffic congestion region and is divided into two categories according to different destinations of traffic demands. Meanwhile, a method for the boundary guidance strategy is presented in which the macroscopic fundamental diagram (MFD) is used to determine the optimal accumulation, a traffic flow equilibrium model is established to calculate the real-time accumulation, and a fuzzy adaptive PID control algorithm is designed to calculate the optimal traffic inflow of the traffic congestion region. Furthermore, an example is selected for simulation. The results show that the boundary guidance strategy can effectively improve the operational state of the road network and alleviate traffic congestion. Finally, the influence of connected vehicle penetration rate on the strategy is discussed. The simulation results show that the strategy can improve the operation state of the road network under mixed traffic flow, and the higher the penetration rate, the more significant its effect on alleviating traffic 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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| 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.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".