Sensor Fault Detection and Isolation for Degrading Lithium-Ion Batteries in Electric Vehicles Using Parameter Estimation with Recursive Least Squares
Bibliographic record
Abstract
With the increase in usage of electric vehicles (EVs), the demand for Lithium-ion (Li-ion) batteries is also on the rise. The battery management system (BMS) plays an important role in ensuring the safe and reliable operation of the battery in EVs. Sensor faults in the BMS can have significant negative effects on the system, hence it is important to diagnose these faults in real-time. Existing sensor fault detection and isolation (FDI) methods have not considered battery degradation. Degradation can affect the long-term performance of the battery and cause false fault detection. This paper presents a model-based sensor FDI scheme for a Li-ion cell undergoing degradation. The proposed scheme uses the recursive least squares (RLS) method to estimate the equivalent circuit model (ECM) parameters in real time. The estimated ECM parameters are put through weighted moving average (WMA) filters, and then cumulative sum control charts (CUSUM) are implemented to detect any significant deviation between unfiltered and filtered data, which would indicate a fault. The current and voltage faults are isolated based on the responsiveness of the parameters when each fault occurs. The proposed FDI scheme is then validated through conducting a series of experiments and simulations.
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.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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 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".