REVIEW 2 cited by
Aging-Aware Battery Control via Convex Optimization
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We consider the task of controlling a battery while balancing two competing objectives that evolve over different time scales. The short-term objective, such as arbitrage or load smoothing, improves with more battery cycling, while the long-term objective is to maximize battery lifetime, which discourages cycling. Using a semi-empirical aging model, we formulate this problem as a convex optimization problem. We use model predictive control (MPC) with a convex approximation of aging dynamics to optimally manage the trade-off between performance and degradation. Through simulations, we quantify this trade-off in both economic and smoothing applications.
Forward citations
Cited by 2 Pith papers
-
Learning Parametric Convex Functions
A neural-network architecture learns parameter-dependent convex functions that remain expressible in disciplined convex programming, with an open-source implementation and applications to battery aging and control.
-
Automatic Generation of Explicit Quadratic Programming Solvers
CVXPYgen can now generate explicit piecewise-affine QP solvers from CVXPY models, achieving microsecond-scale solve times for small parametric problems.
Discussion (0). Continue with ORCID to comment.