Optimal Energy Management Strategy Based on Driving Pattern Recognition for a Dual-Motor Dual-Source Electric Vehicle
Bibliographic record
Abstract
This article introduces a novel approach in electric vehicle technology by combining dual-motor coupling with a hybrid energy storage system (HESS) using batteries and supercapacitors. This innovation enhances vehicle performance and prolongs battery life. An energy management strategy (EMS) based on Pontryagin's minimum principle (PMP) is used to optimize power distribution within the HESS. To improve PMP performance, the proposal integrates driving pattern recognition (DPR) and co-state variable ($\lambda $) control. DPR employs an adaptive network-based fuzzy inference system (ANFIS) for real-time pattern recognition. The process involves creating a sample driving cycle, employing subtractive clustering to establish the original fuzzy inference system (FIS), and fine-tuning FIS parameters through neural network training.$\lambda $values are updated based on recognition results to adapt control actions for various driving styles. Real-time simulations on Opal-RT reveal significant improvements compared to EMS without DPR. Battery current root mean square and standard deviation decrease by 11.4% and 29.4%, respectively, during theunknownin advance Federal Test Procedure (FTP) cycle. This adaptable DPR method offers versatility for various EMSs and clarifies the impact of disturbances like supercapacitor size, state of charge variations, and off-road conditions on HESS performance, aiding researchers in designing more efficient 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.000 |
| 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.001 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 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".