Fuzzy Traffic Light Control Using Cellular Automata for Urban Traffic
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Vehicular travel which demands on the concurrent operations and parallel activities is increasing throughout the world, particularly in large urban areas. Most of the models introduced in the recent years are formulated using the language of cellular automata (CA). In this paper, to control urban traffic, we study the simulation and optimization of traffic light controllers in a city and present an adaptive fuzzy algorithm based on cellular automata properties. We have used CA for simulating transition function of density of vehicles. Although in the existent system environmental factors like priority of streets of intersection and width and length of streets are assumed equal and have no role in making decision for changing the status of traffic light, in real situations parameters like time during the entire day, density of the vehicles of the street, number of shopping centers, offices, malls that have plenty of clients, have determinant effects on amount of traffic of streets. To overcome these limitations we proposed a novel three leveled fuzzy system; at the first level priority of each street is computed momently based on fuzzy rules and regarding to environmental factors. At the second level real velocity of vehicles of every street is calculated at specific moment and at the third level by taking into account two parameters, priority of the street and amount of density behind the traffic light, decision for changing status of traffic light is done. Simulation results of our method underline efficiency and robustness of our approach in comparisons with best available global and adaptive strategies of traffic light 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.
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 it