Online Identification of Vehicle Driving Conditions Using Machine-Learned Clusters
Bibliographic record
Abstract
Modern electrified vehicles rely on drivers to manually adjust control parameters to modify the vehicle's powertrain, such as regenerative braking strength selection or drive mode selection. However, this reliance on infrequent driver input may lead to a mismatch between the selected powertrain control modifiers and the true driving environment. It is therefore advantageous for an electric vehicle's powertrain controller to make online identifications of the current driving conditions. This paper proposes an online driving condition identification scheme that labels drive cycle intervals collected in real-time based on a clustering model, with the objective of informing adaptive powertrain control strategies. HDBSCAN and K-means clustering models are fitted to a data set of drive cycle intervals representing a full range of characteristic driving conditions. The cluster centroids are recorded and used in a vehicle controller to assign driving condition identification labels to the most recently recorded interval of vehicle data. The accuracy of the driving condition identifications of each model is compared by deploying the online identification scheme on the powertrain controller of an electrified vehicle and performing a real-world drive cycle of known driving conditions. The HDBSCAN clusters resulted in superior online driving condition identifications compared to alternative schemes. The main contribution of this paper is the novel application of clustering in an online identification scheme for use in a real-world embedded vehicle controller. By enabling accurate online identification of driving conditions, this approach can improve the powertrain control strategies of electrified vehicles and enhance the driving experience. Future research can leverage the online identification of driving conditions and explore the use of subsequent adaptive control schemes for reducing energy consumption, enhancing safety, and advancing the development of intelligent transportation systems.
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.002 |
| 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.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
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".