A Novel Rear-End Collision Detection Algorithm Based on GNSS Fusion and ANFIS
Bibliographic record
Abstract
Rear-end collisions are one of the most common types of accidents on roads. Global Satellite Navigation Systems (GNSS) have recently become sufficiently flexible and cost-effective in order to have great potential for use in rear-end collision avoidance systems (CAS). Nevertheless, there are two main issues associated with current vehicle rear-end CAS: (1) achieving relative vehicle positioning and dynamic parameters with sufficiently high accuracy and (2) a reliable method to extract the car-following status from such information. This paper introduces a novel integrated algorithm for rear-end collision detection. Access to high accuracy positioning is enabled by GNSS, electronic compass, and lane information fusion with Cubature Kalman Filter (CKF). The judgment of the car-following status is based on the application of the Adaptive Neurofuzzy Inference System (ANFIS). The field test results show that the designed algorithm could effectively detect rear-end collisions with an accuracy of 99.61% and a false alarm rate of 5.26% in the 10 Hz output rate.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| 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.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".