Computing Feasible Operating Region: A Polytope-based Approach for Aggregator-DNO Coordination

Distribution network operators (DNOs) are grappling with numerous challenges due to integration and expansion of distributed energy resources (DERs) in the distribution network (DN). These DERs have the potential to offer control and flexibility assistance to the DNO if exploited judiciously. However, the management of these DERs can be challenging for the DNO. An aggregator, serving as a bridge between DERs and DNO, could assist the DNO in avoiding network constraint violations while reducing the dimensionality. Therefore, this paper proposes an aggregator-DNO coordination model by computing feasible operating regions for DERs via a box polytope/hyper-rectangle-based geometric approach. Aggregators form their bids by aggregating the DER's feasible operating regions via the Minkowski sum. Considering these aggregated bids, the DNO runs a network-constrained optimization model and sends disaggregation signals to the aggregators. It also conveys the feasible operating DER regions for optimal deployment by the aggregator, adhering to network constraints. Hence, the proposed geometric approach holds significant potential for an efficient and effective management of DERs while respecting network feasibility.