Real-time estimation of tire–road friction coefficient based on lateral vehicle dynamics
Bibliographic record
Abstract
This study proposes a two-stage framework for real-time estimation of tire–road friction coefficient of a vehicle on the basis of lateral dynamics of the vehicle. The estimation framework employs a new cascade structure consisting of an extended Kalman filter and two unscented Kalman filters to reduce the computational burden. In the first stage, extended Kalman filter is utilized to estimate lateral velocity of the vehicle and thereby both the front and rear tires’ side-slip angles. In the second stage, a two–unscented Kalman filters sub-framework is formulated in sequence to observe both the front- and rear-axle tire forces, and to subsequently identify their respective tire–road friction coefficient, regarded as two unknown states. All the measured signals required in the study could be realized from the conventional on-board sensors. Typical double-lane change and single-lane change maneuvers were designed and the developed algorithm was verified through CarSim–MATLAB/Simulink software platform considering high-, mid-, and low-friction road conditions. The simulation results show that the proposed method can yield accurate and rapid estimations of the tire–road friction coefficient for mid- and low-friction road conditions even under a single-lane change maneuver, although double-lane change maneuver is needed to accurately estimate the tire–road friction coefficient for high-friction road condition.
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.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 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".