Research on Model Prediction of Remaining Service Life of Lithium-Ion Batteries Based on Chaotic Time Series
Bibliographic record
Abstract
To address the conflicting demands of the energy crisis, environmental pollution, and economic growth, the electric vehicle (EV) industry has expanded rapidly, facilitating the widespread adoption of power batteries. This paper investigates the use of chaos theory and machine learning for predicting the remaining useful life (RUL) of lithium-ion batteries. Firstly, the mutual information method determines the time delay of the monitoring sequence, while the improved false nearest neighbor method (Cao algorithm) establishes the embedding dimension, yielding the phase space reconstruction parameters. Secondly, the maximum Lyapunov exponent identifies the chaotic properties of the capacity decay time series, and a prediction dataset is constructed based on phase space reconstruction theory. Finally, leveraging the chaotic time-series features, a support vector machine (SVM) model is developed for lithium-ion battery RUL prediction. The algorithm is subsequently validated through simulation using the NASA battery dataset. The results demonstrate that the proposed method achieves high predictive accuracy and stability, providing reliable RUL estimates for the battery management system (BMS).
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.001 | 0.001 |
| Open science | 0.001 | 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 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".