Online Modeling of a Fuel Cell System for an Energy Management Strategy Design
Bibliographic record
Abstract
An energy management strategy (EMS) efficiently splits the power among different sources in a hybrid fuel cell vehicle (HFCV). Most of the existing EMSs are based on static maps while a proton exchange membrane fuel cell (PEMFC) has time-varying characteristics, which can cause mismanagement in the operation of a HFCV. This paper proposes a framework for the online parameters identification of a PMEFC model while the vehicle is under operation. This identification process can be conveniently integrated into an EMS loop, regardless of the EMS type. To do so, Kalman filter (KF) is utilized to extract the parameters of a PEMFC model online. Unlike the other similar papers, special attention is given to the initialization of KF in this work. In this regard, an optimization algorithm, shuffled frog-leaping algorithm (SFLA), is employed for the initialization of the KF. The SFLA is first used offline to find the right initial values for the PEMFC model parameters using the available polarization curve. Subsequently, it tunes the covariance matrices of the KF by utilizing the initial values obtained from the first step. Finally, the tuned KF is employed online to update the parameters. The ultimate results show good accuracy and convergence improvement in the PEMFC characteristics estimation.
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.001 |
| Bibliometrics | 0.000 | 0.000 |
| 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.004 | 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".