A Study on How to Utilize Hilly Road Information in Equivalent Consumption Minimization Strategy of FCHEVs
Bibliographic record
Abstract
<div class="section abstract"><div class="htmlview paragraph">This paper presents an adaptation method of equivalent factor in equivalent consumption minimization strategy (ECMS) of fuel cell hybrid electric vehicle (FCHEV) using hilly road information. Instantaneous optimization approach such as ECMS is one of real-time controllers. Furthermore, it is widely accepted that ECMS achieves near-optimum results with the selection of the appropriate equivalent factor. However, a lack of hilly road information no longer guarantees near-optimum results as well as charge-sustaining of ECMS under hilly road conditions. In this paper, first, an optimal control problem is formulated to derive ECMS analytical solution based on simplified models. Then, we proposed updating method of equivalent factor based on sensitivity analysis. The proposed method tries to mimic the globally optimal equivalent factor trajectory extracted from dynamic programming solutions. Finally, simulations for various hilly roads are carried out for validation of the proposed adaptation method of equivalent factor. Results show that the proposed method generates similar equivalent factor trajectory with globally optimal equivalent factor trajectory in the specific drive condition. In conclusion, if future vehicle velocity can be assumed as average velocity such as highway driving mode, the proposed method using hilly road information is very effective in near-optimum results as well as charge-sustaining.</div></div>
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.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| 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".