A Robust Kalman Filter-Based Approach for SoC Estimation of Lithium-Ion Batteries in Smart Homes
Bibliographic record
Abstract
Battery energy systems are playing significant roles in smart homes, e.g., absorbing the uncertainty of solar energy from root-top photovoltaic, supplying energy during a power outage, and responding to dynamic electricity prices. For the safe and economic operation of batteries, an optimal battery-management system (BMS) is required. One of the most important features of a BMS is state-of-charge (SoC) estimation. This article presents a robust central-difference Kalman filter (CDKF) method for the SoC estimation of on-site lithium-ion batteries in smart homes. The state-space equations of the battery are derived based on the equivalent circuit model. The battery model includes two RC subnetworks to represent the fast and slow transient responses of the terminal voltage. Moreover, the model includes the nonlinear relationship between the open-circuit voltage (OCV) and SoC. The proposed robust CDKF method can accurately estimate the SoC in the presence of the time-varying model uncertainties and measurement noises. Being able to cope with model uncertainties and measurement noises is essential, since they can lead to inaccurate SoC estimations. An experiment test bench is developed, and various experiments are conducted to extract the battery model parameters. The experimental results show that the proposed method can more accurately estimate SoC compared with other Kalman filter-based methods. The proposed method can be used in optimal BMSs to promote battery performance and decrease battery operational costs in smart homes.
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.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| 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".