Mean-Field Learning for Storage Aggregation
Jingguan Liu, Cong Chen, Xiaomeng Ai, Jiakun Fang, Jinsong Wang, Jinyu Wen

TL;DR
This paper introduces a mean-field learning framework to efficiently model and aggregate large heterogeneous energy storage populations, enabling accurate, convex, and computationally tractable power system operation representations.
Contribution
It develops a convex surrogate model for large storage populations, with a gradient-based learning algorithm using historical data, improving accuracy and efficiency.
Findings
Aggregate performance converges to a convex mean-field limit.
The surrogate model accurately approximates large storage behaviors.
Case studies demonstrate improved data efficiency and modeling accuracy.
Abstract
Distributed energy storage devices can be aggregated to provide operational flexibility for power systems. This requires representing a massive device population as a single, tractable surrogate that is computationally efficient and accurate. However, surrogate identification is challenging due to heterogeneity, nonconvexity, and high dimensionality of storage devices. To address these challenges, this paper develops a mean-field learning framework for storage aggregation. We interpret aggregation as the average behavior of a large storage population and show that, as the population grows, aggregate performance converges to a unique, convex mean-field limit, enabling tractable population-level modeling. This convexity further yields a price-responsive characterization of aggregate storage behavior and allows us to bound the mean-field approximation error. We construct a convex surrogate…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
