Core Temperature Estimation of Lithium-Ion Batteries Using Long Short-Term Memory (LSTM) Network and Kolmogorov–Arnold Network (KAN)
Bibliographic record
Abstract
Health-conscious battery management systems (BMS) that rely on surface temperature measurements are insufficient for managing automotive lithium-ion batteries (LIBs). Experimental studies have shown temperature differences of up to 10°C between surface and core of cylindrical LIBs. BMSs that consider only surface temperature overlook critical thermal information. The missing monitoring can delay detecting thermal events within the cell, accelerating battery degradation and increasing the risk of thermal runaway. This paper introduces two deep learning algorithms to address this: Kolmogorov-Arnold Network (KAN) and interconnected Long Short-Term Memory (LSTM) network. Both approaches estimate the core temperature of LIBs without requiring surface temperature feedback to the neural network. Experimental validation revealed a core temperature mean absolute error (MAE) of 0.55 °C with a computational cost of 2.9 ms to 3.2 ms for KAN. The proposed interconnected LSTM reached a MAE of 0.80 °C. The performance of the two core temperature estimation techniques was further evaluated under dynamic loading profile using UDDS drive cycle. The KAN method achieved a MAE of 0.325 °C, demonstrating its adaptability to dynamic operating conditions. The two proposed methods, primarily KAN, are both adaptive and computationally efficient, making them suitable for integrating onboard BMS and cloud-enabled digital-twin-based BMS systems.
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.001 |
| 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.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".