CORTEXA
← Browse
arxiveess.SYmath.OC2026-06-26Cited by 0

Rapid and robust parameter estimation for electrochemical battery models via BOLT: A batch-optimized local-to-global technique

Feng Guo, Luis D. Couto, Keivan Haghverdi, Khiem Trad, Grietus Mulder

Accurate and efficient parameter estimation is essential for applying electrochemical battery models in simulation, state estimation, control, and repeated model updating. However, conventional optimization methods, such as particle swarm optimization (PSO) and genetic algorithms (GA), often require many model evaluations and show considerable run-to-run variability, limiting their use in time-sensitive calibration scenarios. This study proposes a Batch-Optimized Local-to-Global Technique (BOLT) for rapid and robust parameter estimation of electrochemical battery models. BOLT combines diversified candidate initialization, batch-parallel trust-region reflective (TRF) local refinement, JIT-accelerated model evaluation, and multi-condition consistency screening within a unified calibration workflow. Comparative experiments based on a grouped single-particle model and measured data from a commercial 18650 NMC lithium-ion cell show that BOLT achieves a favorable trade-off among voltage-response accuracy, computational efficiency, and repeated-run stability. BOLT(32) achieves an average mean absolute error of \(12.4 \pm 0.1\) mV over five operating conditions, requiring only \(20636 \pm 3081\) model calls and \(8.97 \pm 1.20\) s per run. Synthetic-data validation with a known parameter vector in the grouped SPM formulation further shows that BOLT recovers the reference parameter vector under model-consistent conditions and remains robust under 1--3 mV voltage-noise perturbations, with the mean parameter absolute relative error below \(0.6\%\). These results indicate that BOLT provides a practical calibration framework for BMS parameter updating, control-oriented battery digital twins, and second-life battery screening.

View free PDFSource page

Related papers

arxivcs.ROcs.AIcs.LGeess.SYmath.OC2026-07-16

Steering Robustness into World Action Models via Mechanistic Interpretability and Optimal Control

Jihoon Hong, Julian Skifstad, Qiyue Dai, Alice Chan, Glen Chou

World Action Models (WAMs) enable semantically- and physically-informed control but are brittle under distribution shift. In this work, we use mechanistic interpretability to study how robustness-relevant perturbations are represented in WAM activation space. Comparing activation…

View free PDFSource page
arxivmath.OCeess.SY2026-07-21

Optimization models and algorithms for the Unit Commitment problem

Javal Vyas, Carl Laird, Ignacio E. Grossmann, Ricardo M. Lima, Iiro Harjunkoski, Jan Poland

The unit commitment problem determines the optimal strategy to meet the electricity demand at minimum cost by committing power generation units at each point of time. Solving the unit commitment problem gives rise to a challenging optimization problem due to its combinatorial com…

View free PDFSource page
arxiveess.SYmath.OC2026-07-15

VSC-HVDC setpoint adjustment for maximum grid utilisation under voltage constraints

Gabriel Malmer, Emil Hillberg, Olof Samuelsson

Voltage-source converter high-voltage direct current (VSC-HVDC) links offer controllable active and reactive power output, making them a promising asset for emergency voltage support. This paper presents an analytical method for adjusting the active power setpoint of a VSC-HVDC s…

View free PDFSource page
arxiveess.SYmath.OC2026-07-21

Model-Agnostic Meta Learning for Differentiable MPC

Salma Elfeki, Riccardo Zuliani, Niklas Schmid, Efe C. Balta, John Lygeros

Applying policy optimization to Model Predictive Control (MPC) yields high-performance and reliable controllers. However, the resulting controllers often overfit their training conditions and suffer significant performance degradation in unseen tasks. We propose a novel framework…

View free PDFSource page
arxivcs.LGeess.SYmath.OC2026-07-22

Local Stability and Gaussian Smoothing of Quantized Neural Networks

Sergey Salishev, Anton Makarov, Oleg Granichin

We study Gaussian averaging as a smooth surrogate for quantized neural models. Under bounded local oscillation, we derive a local dimension-dependent bound on |f-g|, linking Gaussian smoothing to the stability analysis of discontinuous networks. We compute closed-form Gaussian av…

View free PDFSource page
arxivcs.LGeess.SYmath.OC2026-07-20

Concentration and Mean-Square Bounds for Contractive Stochastic Approximation: A Unified Elementary Approach

Siddharth Chandak

We establish mean-square and concentration bounds for stochastic approximation (SA) with arbitrary norm contractive mappings, under a multiplicative noise model where the noise may scale affinely with the norm of the iterates, and the iterates are potentially unbounded. These set…

View free PDFSource page