Efficient Multi-Market Scheduling of Virtual Power Plants via Spectral Representation of Uncertainty
Lorenzo Zapparoli, Blazhe Gjorgiev, Giovanni Sansavini

TL;DR
This paper introduces a spectral uncertainty representation for multi-market virtual power plant scheduling, significantly reducing computational effort while maintaining decision accuracy.
Contribution
It proposes an intrusive Polynomial Chaos Expansion-based spectral framework that efficiently reformulates stochastic VPP scheduling problems, outperforming traditional scenario-based methods.
Findings
Spectral approach achieves up to 137 times reduction in computational effort.
Solution quality comparable to scenario-based benchmarks.
Open-source tool for spectral reformulation of stochastic programs.
Abstract
As the penetration of distributed energy resources increases, harnessing their flexibility becomes critical for power system operations. Virtual power plants (VPPs) offer a promising solution. However, existing VPP market scheduling tools exhibit a tradeoff between economic performance and tractability. Stochastic formulations provide probabilistically optimal decisions but are computationally intractable for large systems due to scenario explosion. Robust approaches are more tractable but often yield conservative decisions. This paper addresses this gap by proposing a stochastic multi-market VPP scheduling framework that represents uncertainty in the spectral domain via intrusive Polynomial Chaos Expansion (PCE). The resulting reformulation yields a low-dimensional deterministic spectral counterpart that preserves the stochastic structure and can be solved efficiently with standard…
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.
