Network-level comparison of various Forward Collision Warning algorithms
Bibliographic record
Abstract
Rear-end collisions represent a quarter to one-third of the total number of collisions occurring on North American roads. Consequently, Forward Collision Warning (FCW) algorithms have been developed to mitigate this type of critical collision by warning drivers about an impending rear-end event. The algorithms are typically tested to ensure their effectiveness in reducing specific events, such as rear-end conflicts and/or collisions, or by assessing the change in the frequency and severity of braking maneuvers. Such assessments are usually microscopic in nature and deal with isolated (independent) situations. This paper aims at assessing six FCW algorithms at a network level with varying market penetration rates using a calibrated micro-simulation model. The algorithms were assessed in terms of their safety (rear-end conflicts frequency), mobility (travel times), and environmental impacts (emissions and fuel consumption). Based on the results of this study, most of the FCW algorithms did not have a significant effect on mobility nor environmental impacts at various market penetration rates. On the contrary, all the algorithms showed significant safety improvements, in terms of reducing rear-end conflicts, as the market penetration rates increased. The only exception was a single algorithm that tends to be more conservative in terms of braking distance. The results showed that situational improvements (on a driver level) caused by using FCW systems will generally translate into systematic improvements (on a network level). This is important due to the anticipated gradual increase in intelligent vehicles, which are expected to be equipped with FCW systems, on our roads soon.
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.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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".