Inner Approximation of Minkowski Sums: A Union-Based Approach and Applications to Aggregated Energy Resources
share
This paper develops and compares algorithms to compute inner approximations of the Minkowski sum of convex polytopes. As an application, the paper considers the computation of the feasibility set of aggregations of distributed energy resources (DERs), such as solar photovoltaic inverters, controllable loads, and storage devices. To fully account for the heterogeneity in the DERs while ensuring an acceptable approximation accuracy, the paper leverages a union-based computation and advocates homothet-based polytope decompositions. However, union-based approaches can in general lead to high-dimensionality concerns; to alleviate this issue, this paper shows how to define candidate sets to reduce the computational complexity. Accuracy and trade-offs are analyzed through numerical simulations for illustrative examples.
READ FULL TEXT