An Earlier Predictive Rollover Index Designed for Bus Rollover Detection and Prevention
Bibliographic record
Abstract
As vehicle rollovers annually cause a great deal of traffic-related deaths, an increasing number of vehicles are being equipped with rollover prevention systems with the aim of avoiding such accidents. To improve the functionality of active rollover prevention systems, this study provided a potential enhanced method with the intention to predict the tendency of the lateral load transfer ratio (LTR), which is the most common rollover index. This will help provide a certain amount of lead time for the control system to respond more effectively. Before the prediction process, an estimation equation was proposed to better estimate the LTR; the equation was validated using Simulink and TruckSim. Further, to eliminate the influence of drawbacks and make this method practical, a buffer operator was added. Simulation results showed that grey LTR (GLTR) was able to roundly predict the future trend of the LTR based on current and previous data. Under the tests of “Sine with Dwell” (Sindwell) and double lane change (DLC), the GLTR could provide the control system with sufficient time beforehand. Additionally, to further examine the performance of the GLTR, a differential system model was adopted to verify its effectiveness. Through the Sindwell maneuver, it was demonstrated that the GLTR index could improve the performance of the rollover prevention systems by achieving the expected response.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 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.000 | 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".