Traffic Signal Phase Scheduling Based on Device-to-Device Communication
Bibliographic record
Abstract
Device-to-device (D2D) communications enable direct communications among mobile entities, which brings new revolutions to existing cellular networks. Many use cases which can benefit from D2D are introduced such as vehicles-to-vehicles communication, vehicles-to-infrastructure communication, machine-to-machine communication, and so on. With the help of these information communication techniques, we propose a real-time traffic signal control approach to relieve traffic problems in this paper. Currently, a series of traffic problems, such as traffic congestion, traffic accidents, and vehicle exhaust emission, are increasingly inconveniencing city residents, especially in rush hours. One of the most dominating approaches to relieve the traffic congest is to determine the phase timing of traffic signals. However, a major shortcoming of the existing phase timing related control strategies is of highly computational complexity, which causes, to some extent, a response delay. The approach based on D2D communication, in this paper, on one hand can collect data of various types via sensors and actuators and on the other hand can reduce the response time as much as possible. Specifically, considering an intersection with four legs, we encoded the corresponding set of signal lights of each leg using a genetic algorithm. To evaluate the efficiency of phase timing plan in this paper, we have conducted extensive simulations, and the results show that our approach can respond to the considered traffic flow within one second. Compared with other traffic signal control systems, the performance is improved almost by 67% with regards to the queue length waiting at the intersections during traffic signal light cycle(s).
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.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| 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".