Abstract
This paper develops and compares algorithms to compute the inner approximation of Minkowski sum of convex polytopes. We consider flexibility from distributed re- sources, such as solar photovoltaic (PV) inverters, demand side resources, etc. A polytopic representation of a single inverter's feasible operating region is proposed first. The aggregate flexibility can be computed using the Minkowski sum. Homothet and Zonotope-based approaches have been explored in literature. We show that as heterogeneity increases, such approaches lead to conservative estimates. Hence, we show how to exploit union-based Minkowski sum computation through successive homothetic decomposition of polytopes. While the union-based approach can lead to dimensionality issues, we show how to limit the complexity by predefining a candidate set. Efficiency, accuracy and trade-offs have been analyzed. Numerical examples have been presented to illustrate the effectiveness of the proposed algorithm.
Original language | American English |
---|---|
Number of pages | 12 |
State | Published - 2019 |
Event | 2018 IEEE Conference on Decision and Control (CDC) - Miami Beach, Florida Duration: 17 Dec 2018 → 19 Dec 2018 |
Conference
Conference | 2018 IEEE Conference on Decision and Control (CDC) |
---|---|
City | Miami Beach, Florida |
Period | 17/12/18 → 19/12/18 |
NREL Publication Number
- NREL/CP-5D00-73423
Keywords
- aggregation
- flexibility
- inverters
- photovoltaic
- PV
- union-based Minkowski sum algorithm