Dispatching a fleet of distributed energy resources (DERs) in response to wholesale energy market or regional grid signals requires solving a challenging disaggregation problem when the DERs are coupled within a distribution network. This manuscript presents a computationally tractable convex inner approximation for the optimal power flow (OPF) problem that quantifies a feeder’s aggregate DERs hosting capacity and enables a realtime, grid-aware control policy for DERs in radial distribution networks. The inner approximation is derived by considering convex envelopes on the nonlinear terms in the AC power flow equations. The resulting convex formulation is then used to derive provable nodal injection limits, such that any combination of DER dispatches within their respective nodal limits is guaranteed to be AC admissible. These nodal injection limits are then used to construct a realtime, open-loop control policy for dispatching DERs at each location in the network to deliver fast grid services in aggregate. The IEEE-37 distribution network is used to validate the technical results and illustrate use cases.

Load tap changers (LTCs) are commonly used for voltage control in distribution systems. The mechanical relays on LTCs are controlled in discrete steps; hence, distribution optimal power flow (DOPF) formulations require LTCs to be modeled with integer variables. Integer variables are generally ignored or relaxed and rounded off to reduce the computational burden in DOPF models. However, in this work, we highlight and overcome complex infeasibility issues caused by rounding methods. Moreover, recent advances in convex optimization have improved the computational tractability of the DOPF problem. In this work, we develop and analyze numerical efficiency of different, but exact formulations for incorporating LTCs as integer control assets in a relaxed second-order cone program (SOCP) version of DOPF model. The resulting formulation becomes a mixed-integer SOCP (MISOCP), which is computationally tractable compared to mixed-integer non-linear program (MINLP). To recover the exact optimal solution in the proposed MISOCP-DOPF model, a McCormick relaxation is employed within a sequential bound-tightening algorithm. We show that solutions obtained from MISOCP-DOPF are always AC feasible. Thus, the MISOCP-DOPF yields optimal and realistic AC solutions, and is validated in large distribution feeders and is compared to MINLP counterpart.

Compared with large-scale physical batteries, aggregated and coordinated generic energy storage (GES) resources provide low-cost, but uncertain, flexibility for power grid operations. While GES can be characterized by different types of uncertainty, the literature mostly focuses on decision-independent uncertainties (DIUs), such as exogenous stochastic disturbances caused by weather conditions. Instead, this manuscript focuses on newly-introduced decision-dependent uncertainties (DDUs) and considers an optimal GES dispatch that accounts for uncertain available state-of-charge (SoC) bounds that are affected by incentive signals and discomfort levels. To incorporate DDUs, we present a novel chance-constrained optimization (CCO) approach for the day-ahead economic dispatch of GES units. Two tractable methods are presented to solve the proposed CCO problem with DDUs: (i) a robust reformulation for general but incomplete distributions of DDUs, and (ii) an iterative algorithm for specific and known distributions of DDUs. Furthermore, reliability indices are introduced to verify the applicability of the proposed approach with respect to the reliability of the response of GES units. Simulation-based analysis shows that the proposed methods yield conservative, but credible, GES dispatch strategies and reduced penalty cost by incorporating DDUs in the constraints and leveraging data-driven parameter identification. This results in improved availability and performance of coordinated GES units.

This paper develops an efficient algorithm for the optimal dispatch of deterministic inverter-interfaced energy storage in an unbalanced distribution feeder with significant solar PV penetration. The three-phase non-convex loss-minimization problem is formulated as a convex second order cone program (SOCP) for the dispatch of batteries in a receding-horizon fashion in order to counter against the intermittent and variable renewable net-load generation. The solution of the SOCP is used to initialize a nonlinear program (NLP) in order to ensure a physically realizable solution. The phenomenon of simultaneous charging and discharging of batteries is rigorously analyzed and conditions that guarantee it is avoided are derived. Simulation scenarios are implemented with GridLab-D for the IEEE-13 and IEEE-123 node test feeders and illustrate not only feasibility of the solution, but near-optimal performance and with solve times of less than a minute.

The non-convex complementarity constraints present a fundamental computational challenge in energy constrained optimization problems. In this work, we present a new, linear, and robust battery optimization formulation that sidesteps the need for battery complementarity constraints and integers and prove analytically that the formulation guarantees that all energy constraints are satisfied which ensures that the optimized battery dispatch is physically realizable. In addition, we bound the worst-case model mismatch and discuss conservativeness. Simulation results further illustrate the effectiveness of this approach.

High penetrations of intermittent renewable energy resources in the power system require large balancing reserves for reliable operations. Aggregated and coordinated behind-the-meter loads can provide these fast reserves, but represent energy-constrained and uncertain reserves (in their energy state and capacity). To optimally dispatch uncertain, energy-constrained reserves, optimization-based techniques allow one to develop an appropriate trade-off between closed-loop performance and robustness of the dispatch. Therefore, this paper investigates the uncertainty associated with energy-constrained aggregations of flexible, behind-the-meter distributed energy resources (DERs). The uncertainty studied herein is associated with estimating the state of charge and the capacity of an aggregation of DERs (i.e., a virtual energy storage system or VESS). To that effect, a risk-based chance constrained control strategy is developed that optimizes the operational risk of unexpectedly saturating the VESS against deviating generators from their scheduled set-points. The controller coordinates energy-constrained VESSs to minimize unscheduled participation of and overcome ramp-rate limited generators for balancing variability from renewable generation, while taking into account grid conditions. To illustrate the effectiveness of the proposed method, simulation-based analysis is carried out on an augmented IEEE RTS-96 network with uncertain energy resources and temperature-based dynamic line ratings.