This paper develops and analyzes feedback-based online optimization methods to regulate the output of a linear time-invariant (LTI) dynamical system to the optimal solution of a time-varying convex optimization problem. The design of the algorithm is based on continuous-time primal-dual dynamics, properly modified to incorporate feedback from the LTI dynamical system, applied to a proximal augmented Lagrangian function. The resultant closed-loop algorithm tracks the solution of the time-varying optimization problem without requiring knowledge of (time-varying) disturbances in the dynamical system. The analysis leverages integral quadratic constraints to provide linear matrix inequality (LMI) conditions that guarantee global exponential stability and bounded tracking error. Analytical results show that, under a sufficient time-scale separation between the dynamics of the LTI dynamical system and the algorithm, the LMI conditions can be always satisfied. The paper further proposes a modified algorithm that can track an approximate solution trajectory of the constrained optimization problem under less restrictive assumptions. As an illustrative example, the proposed algorithms are showcased for power transmission systems, to compress the time scales between secondary and tertiary control, and allow to simultaneously power re-balancing and tracking of DC optimal power flow points.
6 April 2018 in IEEE Transactions on Power Systems
This paper considers unbalanced multiphase distribution systems with generic topology and different load models, and extends the Z-bus iterative load-flow algorithm based on a fixed-point interpretation of the AC load-flow equations. Explicit conditions for existence and uniqueness of load-flow solutions are presented. These conditions also guarantee convergence of the load-flow algorithm to the unique solution. The proposed methodology is applicable to generic systems featuring i) wye connections; ii) ungrounded delta connections; iii) a combination of wye-connected and delta-connected sources/loads; and iv) a combination of line-to-line and line-to-grounded-neutral devices at the secondary of distribution transformers. Further, a sufficient condition for the nonsingularity of the load-flow Jacobian is proposed. Finally, linear load-flow models are derived, and their approximation accuracy is analyzed. Theoretical results are corroborated through experiments on IEEE test feeders.
22 July 2019 in IEEE Transactions on Control of Network Systems
This paper develops an algorithmic framework for real-time optimization of distribution-level distributed energy resources (DERs). The framework optimizes the operation of DERs that are individually controllable as well as groups of DERs that are jointly controlled at an electrical point of connection. From an electrical standpoint, wye and delta single-phase and multiphase connections are accounted for. The algorithm enables DERs to pursue given performance objectives, while adjusting their powers to respond to services requested by grid operators and to maintain electrical quantities within engineering limits. The design of the algorithm leverages a time-varying bilevel problem formulation, capturing various performance objectives and engineering constraints, and an online implementation of primal-dual projected-gradient methods. The gradient steps are suitably modified to accommodate appropriate measurements from the distribution network and the DERs. The resulting algorithm can cope with inaccuracies in the distribution-system modeling; moreover, it avoids pervasive metering to gather the state of noncontrollable resources, and it naturally lends itself to a distributed implementation. Analytical stability and convergence claims are established in terms of tracking the solution of the formulated time-varying optimization problem. The proposed method is tested in a realistic distribution system by using real data.
This paper considers distribution systems with a high penetration of distributed, renewable generation and addresses the problem of incorporating the associated uncertainty into the optimal operation of these networks. Joint chance constraints, which satisfy multiple constraints simultaneously with a prescribed probability, are one way to incorporate uncertainty across sets of constraints, leading to a chance-constrained optimal power flow problem. Departing from the computationally-heavy scenario-based approaches or approximations that transform the joint constraint into conservative deterministic constraints, this paper develops a scalable, data-driven approach which learns operational trends in a power network, eliminates zero-probability events (e.g., inactive constraints), and accurately and efficiently approximates bounds on the joint chance constraint iteratively. In particular, the proposed framework improves upon the classic methods based on the union bound (or Boole’s inequality) by generating a much less conservative set of single chance constraints that also guarantees the satisfaction of the original joint constraint. The proposed framework is evaluated numerically using the IEEE 37-node test feeder, focusing on the problem of voltage regulation in distribution grids.
10 December 2019 in IEEE Transactions on Smart Grid
With the rising penetration of distributed energy resources, distribution system control and enabling techniques such as state estimation have become essential to distribution system operation. However, traditional state estimation techniques have difficulty coping with the low-observability conditions often present on the distribution system due to the paucity of sensors and heterogeneity of measurements. To address these limitations, we propose a distribution system state estimation algorithm that employs matrix completion (a tool for estimating missing values in low-rank matrices) augmented with noise-resilient power flow constraints. This method operates under low-observability conditions where standard least-squares-based methods cannot operate, and flexibly incorporates any network quantities measured in the field. We empirically evaluate our method on the IEEE 33- and 123-bus test systems, and find that it provides near-perfect state estimation performance (within 1% mean absolute percent error) across many low-observability data availability regimes.
Increasing integration of distributed energy resources (DERs) within distribution feeders provides unprecedented flexibility at the distribution-transmission interconnection. To exploit this flexibility and to use the capacity potential of aggregate DERs, feasible substation power injection trajectories need to be efficiently characterized. This paper provides an ellipsoidal inner approximation of the set of feasible power injection trajectories at the substation such that for any point in the set, there exists a feasible disaggregation strategy of DERs for any load uncertainty realization. The problem is formulated as one of finding the robust maximum volume ellipsoid inside the flexibility region under uncertainty. Though the problem is NP-hard even in the deterministic case, this paper derives novel approximations of the resulting adaptive robust optimization problem based on optimal second-stage policies. The proposed approach yields less conservative flexibility characterization than existing flexibility region approximation formulations. The efficacy of the proposed method is demonstrated on a realistic distribution feeder.