A Data-Driven Auto-CNN-LSTM Prediction Model for Lithium-Ion Battery Remaining Useful Life
Bibliographic record
Abstract
Integration of each aspect of the manufacturing process with the new generation of information technology such as the Internet of Things, big data, and cloud computing makes industrial manufacturing systems more flexible and intelligent. Industrial big data, recording all aspects of the industrial production process, contain the key value for industrial intelligence. For industrial manufacturing, an essential and widely used electronic device is the lithium-ion battery (LIB). However, accurately predicting the remaining useful life (RUL) of LIB is urgently needed to reduce unexpected maintenance and avoid accidents. Due to insufficient amount of degradation data, the prediction accuracy of data-driven methods is greatly limited. Besides, mathematical models established by model-driven methods to represent degradation process are unstable because of external factors like temperature. To solve this problem, a new LIB RUL prediction method based on improved convolution neural network (CNN) and long short-term memory (LSTM), namely Auto-CNN-LSTM, is proposed in this article. This method is developed based on deep CNN and LSTM to mine deeper information in finite data. In this method, an autoencoder is utilized to augment the dimensions of data for more effective training of CNN and LSTM. In order to obtain continuous and stable output, a filter to smooth the predicted value is used. Comparing with other commonly used methods, experiments on a real-world dataset demonstrate the effectiveness of the proposed method.
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.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.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".