Distributed Dynamic Route Guidance and Signal Control for Mobile Edge Computing-Enhanced Connected Vehicle Environment
Bibliographic record
Abstract
The benefit of real-time joint dynamic route guidance and signal control (DRG-SC) is usually compromised by a centralized framework since it naturally leads to an un-timely solution with the growing data-processing needs and problem-solving complexity. Mobile edge computing (MEC) pushes the data storage and computation from the remote cloud to local infrastructures and hence reduces response time and improves network bandwidth when further combined with 5G. As such, our study first develops a novel distributed framework to facilitate DRG-SC in connected vehicle (CV) environment with clarifying the MEC’s vital role. The method captures the interaction of vehicles’ routing and signal control, wherein we use a more realistic and accurate way to define the relationship between travel time and traffic volume. Vehicles make route decisions and cooperate to reach user optimal (UO) or system optimal (SO) traffic state. In tandem, the developed adaptive signal control (ASC) adjusts the signal timing plan with considering both the adjacent intersections’ traffic volume and the vehicles’ waiting time. Our method achieves significant reductions in vehicles’ average departure delay, waiting time and travel time when justified by a comprehensive case study implemented in SUMO. Moreover, the effectiveness of adopting such a distributed framework in saving computation time is verified. Overall, our study provides valuable and practical insights into the intelligent operation and control.
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".