Road Adhesion Coefficient Estimation Based on Vehicle-Road Coordination and Deep Learning
Bibliographic record
Abstract
Accurate estimation of the road adhesion coefficient can help drivers and vehicles perceive changes in road state effectively, reducing the occurrence of traffic crashes accordingly. Therefore, this paper proposes a road adhesion coefficient estimation method based on vehicle-road coordination and deep learning. Firstly, a vehicle-based data feedback system combined with a vehicle-road network cloud is introduced, and CarSim simulation is used to expand the data set and train the model effectively. Then, the dynamic analysis of the whole vehicle is carried out, and the vehicle operation data related to the adhesion coefficient are obtained as the input of the estimation model. Then a combined model of road adhesion coefficient estimation based on self-attention (SA), convolutional neural network (CNN), and long short-term memory (LSTM) is established, to reduce the instability of the prediction, Q-learning is used to optimize the weight of the model. Finally, the model is verified by the simulation data and the actual vehicle-based data. The results show that the vehicle-based data feedback system combined with the vehicle-road network Ccloud is effective, and compared with other commonly used model, the estimation model proposed in this paper can effectively predict the road adhesion coefficient.
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.001 |
| Research integrity | 0.000 | 0.001 |
| 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".