Backend
Robust State-Parameter Estimation in Second-Order Th\'evenin Batteries
arXiv cs.SY0 views
arXiv:2611.13202v1 Announce Type: new Abstract: We propose a scheme for estimating the full states and parameters of a second-order Th\'evenin battery model, using distinct features of the measured current. An identification step, run during suitable rest intervals, identifies the resistances and capacitances of the two RC branches from the voltage relaxation by linear least squares, without knowledge of the open-circuit voltage (OCV) map. An online estimator then runs continuously: the polarization voltages are estimated by open-loop observers; the series resistance is updated at current jumps using least squares; the state of charge (SOC) is propagated by Coulomb counting using the current capacity estimate, and both estimates are updated periodically by a sliding-window regression. We show that the identification is exact under a mild rank condition, that the series resistance is recovered at the first current jump, and that the online state and capacity estimates converge exponentially under verifiable excitation conditions. We also establish robustness of the online estimator under bounded process disturbances and measurement noise.
Source:https://arxiv.org/abs/2611.13202PreviousRisk-Aware Dynamic Operating Envelopes for Battery Arbitrage in Unbalanced Distribution NetworksNextImage-Driven Control with Application to Thermoforming
Related posts
Holonic Graceful Transitions Across Centralized, Decentralized, Distributed, and Local Control in DER-rich Cyber-Power Distribution System
0arXiv cs.NI
fRAC: Remote Accelerator Calls on Hostless FPGAs
0arXiv cs.NI
Verifiable Agentic Traffic Class: A Policed Quality-of-Service Mechanism for Agentic AI Traffic, Evaluated from Simulation to Real-Kernel Adversarial Testing
0arXiv cs.NI
An Improved $(1+2e)$-Approximation Algorithm for Metric Data Placement
0arXiv cs.NI
HERO-D3QN: Inter-Cluster Routing with Energy-Aware Soft Constraints in Wireless Sensor Networks
0arXiv cs.NI
Network-Co-Designed Dynamic Sparsification for Dependable Distributed Robot Learning over 3GPP Networks
0arXiv cs.NI