Dynamic Traffic Prediction-Based Energy Management of Connected Plug-In Hybrid Electric Vehicles with Long Short-Term State of Charge Planning
Bibliographic record
Abstract
Vehicle electrification, automation, and connectivity in today's transportation require significant efforts in control design to meet conflicting goals of energy efficiency, traffic safety, as well as comfort. The rapid development of intelligent transportation systems (ITS) and the rapid growth of connectivity technologies enable vehicles to receive more information about traffic conditions, which provides a reliable solution for the energy management of plug-in hybrid electric vehicles (PHEVs). This article proposes a predictive energy management strategy (EMS) for connected PHEV based on real-time dynamic traffic prediction. First, the future traffic information is predicted by establishing a wavelet neural network (WNN). Thus, the global driving condition can be predicted. Then, the particle swarm optimization (PSO) algorithm is used to optimize the parameters of WNN to plan a global battery state-of-charge (SOC) reference. Second, a long short-term memory-based velocity predictor is proposed for the predictive EMS, by planning SOC over a prediction horizon based on the global SOC reference. Finally, the performance of the proposed EMS with WNN and PSO-WNN is verified by the actual traffic data. The results show that it can improve the fuel economy by 17.57% and 28.19%, respectively.
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.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| 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".