A Formally Integrated Adaptive Speed Management for Proactive Traffic Safety
Bibliographic record
Abstract
The emergence of connected autonomous vehicles (CAVs) represents a key development in the quest to enhance traffic safety. CAVs hold significant promise for improving traffic safety and have great potential to contribute to transportation sustainability. However, their safety depends on the accuracy of the programmed rules and algorithms that guide their decision-making process. This article introduces an adaptive traffic management system that integrates a formal traffic safety rule defined by pre-established bounds for Traffic Conflict Techniques. This system enables dynamic speed adjustments for vehicles violating the traffic safety rule to prevent potential collisions. To evaluate the effectiveness of our approach, we study a traffic flow on the SR528 highway in Orlando, Florida, and analyze the behavior of each vehicle in traffic based on extracted traffic safety indicators such as time-to-collision and space headway. This analysis is performed by the traffic safety rule to identify violating vehicles, and the speed update is achieved through the integration of the computer algebra system Mathematica and a micro-simulation tool called SUMO. Our study aims to improve the safety and efficiency of the traffic flow by combining simulation, TCTs analysis, and semi-formal tools like Mathematica to aid in the decision-making process of vehicles during traffic events, particularly shockwaves. Preliminary results demonstrate the efficacy of our approach in mitigating the impact of shockwaves. After applying the speed update, we observe an increase in time-to-collision and space headway. This indicates improved safety and reduced likelihood of collisions. Our findings highlight the potential of adaptive traffic management systems to enhance transportation safety and efficiency.
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".