Search arXiv⌕ Search

arXiv · 2610.22787

Filter-Augmented Reinforcement Learning for Battery Fast Charging with State of Health and Plating-Aware Reward Design

Abstract

Fast charging of lithium-ion batteries is crucial for electric vehicle adoption, yet it increases safety risks and accelerates battery ageing. To address this, we propose a filter-augmented reinforcement learning (RL) framework for lifelong health-aware fast charging, based on the twin-delayed deep deterministic policy gradient (TD3) algorithm. The RL agent is guided by a reward function that balances charging speed and battery longevity through the incorporation of state of health (SoH) information and an SoH-dependent voltage penalty term derived from a constant--current constant--overpotential charging strategy. Since onboard SoH estimates are inevitably corrupted by noise, two filtering strategies are integrated: an exponential moving average (EMA) filter when noise statistics are unknown, and a Kalman filter when they are available, with the filtered estimate embedded in both the agent's state and reward computation. The RL policy is trained using data from high-fidelity life-cycle simulations. The evaluation uses a published electrochemical and degradation parameterisation for a commercial LG M50 cell. Results show that the proposed method achieves up to 21.4\% more equivalent full cycles (EFCs) than conventional constant current--constant voltage (CC--CV) charging under 2\% SoH estimation noise, and maintains this lifetime advantage even under 5\% noise, while sustaining comparable charging speed.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Meng Yuan, Yang Li, Changfu Zou. 2026-10-16. Filter-Augmented Reinforcement Learning for Battery Fast Charging with State of Health and Plating-Aware Reward Design. https://arxiv.org/abs/2610.22787

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Hybrid Cones: Set Representation with Sharp Unions of Minimal Overhead for Nonlinear and Switched Linear Systems

Reachability analysis and set-based estimation for nonlinear systems require set representations capable of capturing nonconvex geometry. Hybrid Zonotopes (HZs) have recently gained attention because they can encode a union of up to $2^n$ polytopic components. Recent work has further shown that several HZ operations can be made \textit{sharp}, meaning that relaxing the binary variables yields exactly the convex hull of the represented set. However, no known HZ construction provides a sharp union of two convex sets that adds only one binary generator and no further continuous generators or equality constraints to those of the operands. This limitation affects scalability in repeated union operations, ReLU neural-network reachability, and nonlinear propagation methods that cover graph sets by unions of simpler sets. This paper identifies a connection between the exact closed-form convex-hull operation for Constrained Convex Generators (CCGs) and the binary-generator structure underlying HZs. We propose Hybrid Cones that can encode up to $2^n$ norm-cone components. Hybrid Cones inherit the logical structure of HZs while allowing richer convex components, including polytopic and norm-based sets. They support sharp unions requiring only one added binary variable and can represent unions and intersections of polytopes and ellipsoids. As a key application, we derive an exact representation of the ReLU graph using only two continuous and one binary generators. Numerical experiments for a localization problem with a nonlinear energy measurement function approximated by a neural network and the stability verification of the closed loop of a double integrator corrupted by a nonlinear disturbance with a saturated Linear Quadratic Regulator (LQR) controller show substantial reduction in representation size and reduced conservatism in comparison with HZs.

eess.SY↗

Data Center Load Accommodation under QoS and Checkpoint-Induced Frequency Security Constraints

The rapid growth of artificial intelligence workloads is accelerating the expansion and grid interconnection of data centers (DCs). Existing data center load accommodation (DCLA) assessments primarily focus on grid and resource adequacy and often imply that greater workload flexibility always increases accommodable capacity. However, workload flexibility has a dual effect. Workload deferral and temporal shifting can alleviate network congestion, whereas synchronized checkpointing of training workloads can cause large and rapid load reductions, threatening frequency stability. Therefore, DCLA cannot be determined solely by grid adequacy. This paper develops an optimal DCLA method that jointly accounts for workload quality of service (QoS), checkpoint-induced frequency security (FS), and grid adequacy. First, a QoS-aware model characterizes workload-dependent flexibility while ensuring service feasibility. Second, checkpoint-induced FS constraints are developed for periodic and event-triggered power variations, with key frequency-security limits reformulated in algebraic form. Third, a two-stage lexicographic model is developed to maximize DCLA and minimizes the required energy storage (ES) deployment, and then optimizes system operation under the given DC and ES siting and sizing decisions. Case studies show that the proposed method avoids a 40.3% overestimation of DCLA compared with the grid-adequacy benchmark. QoS is the primary limiting factor, while checkpoint-induced frequency-security constraints become more restrictive as training workloads increase. These findings highlight that reliable DCLA should account for both its grid-support value and the associated QoS and FS risks.

eess.SY↗

Converter-Aware Coordination of Computing Flexibility in Behind-the-Meter Data Centers

Data centers are emerging as large electricity consumers whose demand can be reshaped through workload scheduling. However, computing flexibility in behind-the-meter facilities does not automatically translate into electrically realizable power flexibility. Ignoring converter and network operating limits may cause converter overloads, protection trips, and interruptions to power supply and computing services. This paper proposes a converter-aware intraday scheduling methodology. First, a task-level mixed-integer linear formulation preserves synchronous training configurations and completion requirements, while Minkowski-sum aggregation and Shapley--Folkman convexification yield a linear inference-pool representation without unit-level binary variables. The latter admits a conditional relative relaxation-gap bound that decreases inversely with pool size. Second, a four-node electrical model links computing demand, on-site injections, and grid exchange to converter and network limits through lifted voltage variables and second-order cone relaxation. Finally, a mixed-integer model coordinates workloads, photovoltaic generation, energy storage, and grid purchases. Case studies show that electrical limits reshape scheduling and renewable utilization, while on-site resources reduce grid dependence. Under the studied conditions, fixed training cannot support full inference service within voltage limits, whereas coordinated scheduling achieves negligible inference shortage and passes verification against the original alternating-current model. These findings demonstrate the role of computing--electrical coordination in realizing the operational value of workload flexibility.

eess.SY↗