An Innovative Framework for Dynamic Traffic Lights Management Based on the Combined Use of Fuzzy Logic and Several Network Architectures
Bibliographic record
Abstract
The development of Information and Communication Technologies (ICT) has now reached some entirely unexpected domains. Many applications in modern cities lead to novelties, resulting in new habits of the citizens of tomorrow’s smart cities. These innovations include Intelligent Transportation Systems (ITS). An important application domain of ITS is undoubtedly represented by the dynamic and optimized management of traffic-lighted road intersections. Although several works have already been presented in the literature over the years, many have not considered the new perspectives regarding the source of data to manage traffic lights, i.e., not only Wireless Sensor Networks (WSNs), but, mainly, the vehicular communications. This paper introduces an innovative approach to dynamically regulating traffic light cycles and phases in an isolated intersection. The suggested method can fit data management from WSNs and vehicular communications through IEEE 802.11p and LTE-V2V, employing various Fuzzy Logic Controllers (FLCs) that manage vehicles turning movements for dynamic controls of both the phase and the green time of traffic lights. The results obtained will allow us to observe that the proposed application is better than the others. Each of the implemented configurations will bring advantages and disadvantages that allow choosing one configuration or another based on specific project requirements.
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.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".