MétaCan
Menu
Back to cohort

Enhancing Memory-Limited Feedforward Neural Networks for State of Charge Estimation through Temporal Feature Engineering

2025· article· en· W4413513674 on OpenAlexaff
Mohamed Yousef, Mohammad Shaterabadi, Houshang Karimi

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicMachine Fault Diagnosis Techniques
Canadian institutionsYork University
Fundersnot available
KeywordsComputer scienceFeed forwardFeature engineeringFeature (linguistics)Artificial neural networkFeedforward neural networkState (computer science)Artificial intelligenceEstimationControl engineeringDeep learningEngineeringAlgorithmSystems engineering

Abstract

fetched live from OpenAlex

State-of-charge (SOC) estimation is a key function of Battery Management Systems (BMS) in electric vehicles and battery energy storage systems. However, SOC is not directly measurable, making accurate estimation inherently challenging. Data-driven approaches offer a practical solution by leveraging measurable inputs such as voltage, current, and temperature. Feedforward Neural Networks (FNNs) are attractive due to their low computational complexity, but they lack inherent temporal memory, unlike recurrent architectures. This paper investigates three established casual smoothing techniques-moving average, Butterworth filtering, and exponential moving average-as temporal memory proxies for enhancing FNN-based SOC estimation. Their effectiveness is supported by frequency-domain analysis using the Fast Fourier Transform (FFT), which reveals that key signal dynamics occur at ultra-low frequencies (less than 0.1 mHz), justifying the use of smoothing as memory-preserving transformations. The main contribution of this work is a unified, frequency-informed evaluation framework that systematically benchmarks these techniques under consistent conditions and across varying temperatures. All models are trained and evaluated on LG 18650HG2 Lithium-ion battery data, with 20 repeated runs per model to ensure statistical robustness.

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 distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.879
Threshold uncertainty score0.948

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.006
GPT teacher head0.261
Teacher spread0.255 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicMachine Fault Diagnosis TechniquesFrench-language works237,207