Study on a Right-Turning Intelligent Vehicle Collision Warning and Avoidance Algorithm Based on Monte Carlo Simulation
Bibliographic record
Abstract
With the development of intelligent vehicle technology, the demand for advanced driver assistant systems kept increasing. To improve the performance of the active safety systems, we focused on right-turning vehicle’s collision warning and avoidance. We put forward an algorithm based on Monte Carlo simulation to calculate the collision probability between the right-turning vehicle and another vehicle (or pedestrian) in intersections. We drew collision probability curves which used time-to-collision as the horizontal axis and collision probability as the vertical axis. We established a three-level collision warning system and used software to calculate and simulate the collision probability and warning process. To avoid the collision actively when turning right, a two-stage braking strategy is applied. Taking four right-turning collision conditions as examples, the two-stage braking strategy was applied, analysing and comparing the anteroposterior curve diagram simultaneously to avoid collision actively and reduce collision probability. By comparison, the collision probability 2 s before active collision avoidance was more than 80% and the collision probability may even reach 100% in certain conditions. To improve the active safety performance, the two-stage braking strategy can reduce the collision probability from exceeding 50% to approaching 0% in 2 s and reduce collision probability to less than 5% in 3 s. By changing four initial positions, the collision probability curve calculation algorithm and the two-stage braking strategy are validated and analysed. The results verified the rationality of the collision probability curve calculation algorithm and the two-stage braking strategy.
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.003 |
| 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.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".