Road Surface Estimation Using Machine Learning
Bibliographic record
Abstract
Vehicle motion control systems are present on commercial vehicles to improve safety and driving comfort. Many of these control systems could be further improved given accurate online information about the road condition to accommodate for driving under poor weather conditions such as icy roads or heavy rain. However, sensors for direct friction measurement are not present on commercial vehicles due to production costs. Hence, it is beneficial to incorporate an online estimation scheme for road surface classification. \n \nThis thesis focuses on investigating two fundamentally different machine learning-based methods for road surface classification. The first is an artificial neural network that provides a global function approximation of the underlying dynamics. In particular, Long Short-Term Memory (LSTM) units are used to capture temporal relationships within the training data and to mitigate the vanishing gradient problem. The second is an instance-based learning method referred to as Nadaraya-Watson Kernel Regression, where local function approximations are generated around the input data. \n \nResults indicated that both machine learning-based methods were able to classify road conditions to a reasonable degree of accuracy after tuning associated hyperparameters. However, each method has different benefits and drawbacks. The LSTM network model was capable of making accurate predictions on inputs drastically different from data points within the training data set, was generally more accurate on predictions associated with new driving maneuvers, required less storage for implementation, and had relatively short prediction times. Conversely, the Nadaraya-Watson Kernel Regression model was generally more accurate at making predictions on inputs that were very similar to data points within the training data set, did not require any training time to incorporate newly collected data into the model, and generated predictions that were more easily explainable.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".