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-08

On the Robustness in Data-Driven Nonlinear Optimal Control: From Stability to Optimality

Yicheng Lin, Zhisheng Duan, Tianzhi Li, Bingxian Wu, Zhiyong Sun

In data-driven nonlinear control, optimal controllers designed from learned models are inevitably subject to model mismatch when deployed on actual systems, potentially compromising both closed-loop stability and optimality. This paper investigates how the model mismatch propagat…

View free PDFSource page
arxiveess.SYcs.AIcs.LGcs.ROmath.OC2026-07-01

GPU-Parallel Linearization Error Bounds for Real-Time Robust Optimal Control of Nonlinear and Neural Network Dynamics

Jeffrey Fang, Keyi Shen, Anutam Srinivasan, Glen Chou

This paper studies real-time robust optimal control for uncertain nonlinear systems, where linear time-varying (LTV) approximations make planning tractable but require sound linearization error bounds (LEBs) to guarantee robust constraint satisfaction. We develop tight, different…

View free PDFSource page
arxivmath.OCeess.SY2026-07-13Cited by 1

Sparse Robust Optimal Control in Continuous-Time: A Computationally Viable Approach

Siddhartha Ganguly, Ashwin Aravind, Souvik Das, Masaaki Nagahara, Debasish Chatterjee

This article presents a novel, numerically viable algorithm for solving sparse robust optimal control problems in continuous time. We consider a constrained linear noisy system governed by an ordinary differential equation (ODE), with an $L^1$-type objective function in line with…

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.SYcs.ROmath.OC2026-07-09

Adaptive MPPI with Online Disturbance Covariance Estimation: Provable Stability Tightening via Spatial Smoothing

Hyung-Jin Yoon, Hunmin Kim

We study Model Predictive Path Integral (MPPI) control for nonlinear systems with additive process disturbances whose covariance is unknown, spatially varying, and slowly time-varying. A mismatched disturbance covariance produces a persistent penalty in closed-loop stability cert…

View free PDFSource page