A Convexified Eulerian Framework for Scalable Coordination of Massive DER Populations
Ge Chen, Yiwei Qiu, Shiyao Zhang, Pengfei Su, Haoran Deng, Hongcai Zhang

TL;DR
This paper introduces a scalable, privacy-preserving coordination framework for large populations of distributed energy resources using a PDE-based Eulerian model, convexification, and a two-layer control architecture.
Contribution
It develops a convexification approach for PDE-constrained optimization and a two-layer architecture that ensures scalability and privacy in DER coordination.
Findings
Framework is scalable and computationally independent of population size.
Convexification reformulates the problem into a sparse linear program.
Numerical results demonstrate improved economic performance and feasibility.
Abstract
This paper proposes a scalable coordination framework with aggregator-side privacy protection for storage-like distributed energy resources (DERs). The framework adopts a two-layer architecture. At the macroscopic layer, building upon an \emph{Eulerian} modeling perspective, the DER population is represented as a continuum whose density evolution is governed by a partial differential equation (PDE), such that the computational complexity is independent of the population size. To address the bilinear non-convexity in this PDE-constrained optimization problem, we develop a convexification method that combines finite-volume discretization with a flux-lifting technique, reformulating the macroscopic problem into a sparse linear program (LP). The LP solution yields a unified, state-dependent broadcast signal for population coordination. Furthermore, a Wasserstein-based relaxation is…
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.
