skip to main content


Title: Optimal Grid – Distributed Energy Resource Coordination: Distribution Locational Marginal Costs and Hierarchical Decomposition
We consider radial distribution networks hosting Distributed Energy Resources (DERs), including Solar Photo­voltaic (PV) and storage-like loads, such as Electric Vehicles (EVs). We employ short-run dynamic Distribution Locational Marginal Costs (DLMCs) of real and reactive power to co­optimize distribution network and DER schedules. Striking a balance between centralized control and distributed self­dispatch, we present a novel hierarchical decomposition ap­proach that is based on centralized AC Optimal Power Flow (OPF) interacting with DER self-dispatch that adapts to real and reactive power DLMCs. The proposed approach is designed to be highly scalable for massive DER Grid integration with high model fidelity incorporating rigorous network component dynamics and costs and reffecting them in DLMCs. We illustrate the use of an Enhanced AC OPF to discover spatiotemporally varying DLMCs enabling optimal Grid-DER coordination in­corporating congestion and asset (transformer) degradation. We employ an actual distribution feeder to exemplify the use of DLMCs as financial incentives conveying sufficient information to optimize Distribution Network and DER (PV and EV) operation, and we discuss the applicability and tractability of the proposed approach, while modeling the full complexity of spatiotemporal DER capabilities and preferences.  more » « less
Award ID(s):
1733827
NSF-PAR ID:
10208113
Author(s) / Creator(s):
;
Date Published:
Journal Name:
57th Allerton Conference on Communication, Control, and Computing. Allerton, September 24-27, 2019
Page Range / eLocation ID:
318 to 325
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Dispatching a large 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 located within a distribution network. This manuscript presents a computationally tractable convex inner approximation for the optimal power flow (OPF) problem that characterizes a feeders aggregate DERs hosting capacity and enables a realtime, grid-aware dispatch of DERs for 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 collectively deliver grid services. The IEEE-37 distribution network is used to validate the technical results and highlight various use-cases. 
    more » « less
  2. Growing penetrations of single-phase distributed generation such as rooftop solar photovoltaic (PV) systems can increase voltage unbalance in distribution grids. However, PV systems are also capable of providing reactive power compensation to reduce unbalance. In this paper, we compare two methods to mitigate voltage unbalance with solar PV inverters: a centralized optimization-based method utilizing a three-phase optimal power flow formulation and a distributed approach based on Steinmetz design. While the Steinmetz-based method is computationally simple and does not require extensive communication or full network data, it generally leads to less unbalance improvement and more voltage constraint violations than the optimization-based method. In order to improve the performance of the Steinmetz-based method without adding the full complexity of the optimization-based method, we propose an integrated method that incorporates design parameters computed from the set-points generated by the optimization-based method into the Steinmetz-based method. We test and compare all methods on a large three-phase distribution feeder with time-varying load and PV data. The simulation results indicate trade-offs between the methods in terms of computation time, voltage unbalance reduction, and constraint violations. We find that the integrated method can provide a good balance between performance and information/communication requirements. 
    more » « less
  3. For fast timescales or long prediction horizons, the AC optimal power flow (OPF) problem becomes a computational challenge for large-scale, realistic AC networks. To overcome this challenge, this paper presents a novel network reduction methodology that leverages an efficient mixed-integer linear programming (MILP) formulation of a Kron-based reduction that is optimal in the sense that it balances the degree of the reduction with resulting modeling errors in the reduced network. The method takes as inputs the full AC network and a pre-computed library of AC load flow data and uses the graph Laplacian to constraint nodal reductions to only be feasible for neighbors of non-reduced nodes. This results in a highly effective MILP formulation which is embedded within an iterative scheme to successively improve the Kron-based network reduction until convergence. The resulting optimal network reduction is, thus, grounded in the physics of the full network. The accuracy of the network reduction methodology is then explored for a 100+ node medium-voltage radial distribution feeder example across a wide range of operating conditions. It is finally shown that a network reduction of 25-85% can be achieved within seconds and with worst-case voltage magnitude deviation errors within any super node cluster of less than 0.01pu. These results illustrate that the proposed optimization-based approach to Kron reduction of networks is viable for larger networks and suitable for use within various power system applications. 
    more » « less
  4. null (Ed.)
    We consider decentralized scheduling of Distributed Energy Resources (DERs) in a day-ahead market that clears energy and reserves offered by both centralized generators and DERs. Recognizing the difficulty of scheduling transmission network connected generators together with distribution feeder connected DERs that have complex intertemporal preferences and dynamics, we propose a tractable distributed algorithm where DERs self-schedule based on granular Distribution Locational Marginal Prices (DLMPs) derived from LMPs augmented by distribution network costs. For the resulting iterative DER self-scheduling process, we examine the opportunity of DERs to engage in strategic behavior depending on whether DERs do or do not have access to detailed distribution feeder information. Although the proposed distributed algorithm is tractable on detailed real-life network models, we utilize a simplified T&D network model to derive instructive analytical and numerical results on the impact of strategic DER behavior on social welfare loss, and the distribution of costs and benefits to various market participants. 
    more » « less
  5. null (Ed.)
    Pronounced variability due to the growth of renewable energy sources, flexible loads, and distributed generation is challenging residential distribution systems. This context, motivates well fast, efficient, and robust reactive power control. Optimal reactive power control is possible in theory by solving a non-convex optimization problem based on the exact model of distribution flow. However, lack of high-precision instrumentation and reliable communications, as well as the heavy computational burden of non-convex optimization solvers render computing and implementing the optimal control challenging in practice. Taking a statistical learning viewpoint, the input-output relationship between each grid state and the corresponding optimal reactive power control (a.k.a., policy) is parameterized in the present work by a deep neural network, whose unknown weights are updated by minimizing the accumulated power loss over a number of historical and simulated training pairs, using the policy gradient method. In the inference phase, one just feeds the real-time state vector into the learned neural network to obtain the ‘optimal’ reactive power control decision with only several matrix-vector multiplications. The merits of this novel deep policy gradient approach include its computational efficiency as well as robustness to random input perturbations. Numerical tests on a 47-bus distribution network using real solar and consumption data corroborate these practical merits. 
    more » « less