Voltage Relaxation Pattern Recognition for Efficient Sorting of Healthy Cells for Second-Life Applications of Retired Electric Vehicle Batteries
Bibliographic record
Abstract
First-generation electric vehicle (EV) batteries are now retiring from their first life with 70–80%of their initial capacity and are becoming available in the market. To harness the remaining capacity of retired batteries before they reach the end of their life, researchers have proposed various methods, including backup and emergency power supplies for homes, grid-tied stationary energy storage, and storage for renewable energy applications. These applications are collectively termed second-life applications. The first step in utilizing these retired batteries is the selection of healthy cells, as cells in an EV battery pack do not degrade evenly. State-of-the-art cell selection and sorting techniques are either ineffective for industrial-grade applications or highly time-consuming processes. Therefore, this paper proposes a charging voltage relaxation pattern recognition method to efficiently sort healthy cells, powered by data-driven machine learning algorithms. A wide range of battery cycling data collected under different ambient and charging conditions is used for training, testing, and validating the proposed sorting strategy. Furthermore, a comparative analysis is conducted to demonstrate the effectiveness of the proposed strategy compared to state-of-the-art methods.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| 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.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
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".