Scalable Computation of 2D-Minkowski Sum of Arbitrary Non-Convex Domains: Modeling Flexibility in Energy Resources
- BATTELLE (PACIFIC NW LAB)
The flexibility of active ($$p$$) and reactive power ($$q$$) consumption in distributed energy resources (DERs) can be represented as a (potentially non-convex) set of points in the $$p$$-$$q$$ plane. Modeling of the aggregated flexibility in a heterogeneous ensemble of DERs as a Minkowski sum (M-sum) is computationally intractable even for moderately sized populations. In this article, we propose a scalable method of computing the M-sum of the flexibility domains of a heterogeneous ensemble of DERs, which are allowed to be non-convex, non-compact. In particular, the proposed algorithm computes a guaranteed superset of the true M-sum, with desired accuracy. The worst-case complexity of the algorithm is computed. Special cases are considered, and it is shown that under certain scenarios, it is possible to achieve a complexity that is linear with the size of the ensemble. Numerical examples are provided by computing the aggregated flexibility of different mix of DERs under varying scenarios.
- Research Organization:
- Pacific Northwest National Laboratory (PNNL), Richland, WA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC05-76RL01830
- OSTI ID:
- 1599079
- Report Number(s):
- PNNL-SA-135729
- Country of Publication:
- United States
- Language:
- English
Similar Records
A Minkowski difference-based advancing front packing technique for generating convex noncircular particles in complex domains
Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution