Konstantin Turitsyn

DC microgrids are prone to small-signal instabilities due to the presence of tightly regulated loads. This paper develops a decentralized stability certificate which is capable of certifying the small-signal stability of an islanded DC network containing such loads. Utilizing a novel homotopy approach, the proposed standards ensure that no system eigenmodes are able to cross into the unstable right half plane for a continuous range of controller gain levels. The resulting “standards” can be applied to variety of grid components which meet the specified, but non-unique, criteria. These standards thus take a step towards offering plug-and-play operability of DC microgrids. The proposed theorems are explicitly illustrated and numerically validated on multiple DC microgrid test-cases containing both buck and boost converter dynamics.

DC microgrids are prone to small-signal instabilities due to the presence of tightly regulated loads. This paper develops a decentralized stability certificate which is capable of certifying the small-signal stability of an islanded DC network containing such loads. Utilizing a novel homotopy approach, the proposed standards ensure that no system eigenmodes are able to cross into the unstable right half plane for a continuous range of controller gain levels. The resulting "standards" can be applied to variety of grid components which meet the specified, but non-unique, criteria. These standards thus take a step towards offering plug-and-play operability of DC microgrids. The proposed theorems are explicitly illustrated and numerically validated on multiple DC microgrid test-cases containing both buck and boost converter dynamics.

Electric power grids regularly experience uncertain fluctuations from load demands and renewables, which poses a risk of violating operational limits designed to safeguard the system. In this paper, we consider the robust AC OPF problem that minimizes the generation cost while requiring a certain level of system security in the presence of uncertainty. The robust AC OPF problem requires that the system satisfy operational limits for all uncertainty realizations within a specified uncertainty set. Guaranteeing robustness is particularly challenging due to the non-convex, nonlinear AC power flow equations, which may not always have a solution. In this work, we extend a previously developed convex restriction to a robust convex restriction , which is a convex inner approximation of the non-convex feasible region of the AC OPF problem that accounts for uncertainty in the power injections. We then use the robust convex restriction in an algorithm that obtains robust solutions to AC OPF problems by solving a sequence of convex optimization problems. We demonstrate our algorithm and its ability to control robustness versus operating cost trade-offs using PGLib test cases.

We present an algorithm for robust model predictive control with consideration of uncertainty and safety constraints. Our framework considers a nonlinear dynamical system subject to disturbances from an unknown but bounded uncertainty set. By viewing the system as a fixed point of an operator acting over trajectories, we propose a convex condition on control actions that guarantee safety against the uncertainty set. The proposed condition guarantees that all realizations of the state trajectories satisfy safety constraints. Our algorithm solves a sequence of convex quadratic constrained optimization problems of size n*N, where n is the number of states, and N is the prediction horizon in the model predictive control problem. Compared to existing methods, our approach solves convex problems while guaranteeing that all realizations of uncertainty set do not violate safety constraints. Moreover, we consider the implicit time-discretization of system dynamics to increase the prediction horizon and enhance computational accuracy. Numerical simulations for vehicle navigation demonstrate the effectiveness of our approach.

Electric power grids regularly experience uncertain fluctuations from load demands and renewables, which poses a risk of violating operational limits designed to safeguard the system. In this paper, we consider the robust AC OPF problem that minimizes the generation cost while requiring a certain level of system security in the presence of uncertainty. The robust AC OPF problem requires that the system satisfy operational limits for all uncertainty realizations within a specified uncertainty set. Guaranteeing robustness is particularly challenging due to the non-convex, nonlinear AC power flow equations, which may not always have a solution. In this work, we extend a previously developed convex restriction to a robust convex restriction, which is a convex inner approximation of the non-convex feasible region of the AC OPF problem that accounts for uncertainty in the power injections. We then use the robust convex restriction in an algorithm that obtains robust solutions to AC OPF problems by solving a sequence of convex optimization problems. We demonstrate our algorithm and its ability to control robustness versus operating cost trade-offs using PGLib test cases.

This article studies the contraction properties of nonlinear differential-algebraic equation (DAE) systems. Such systems typically appear as a singular perturbation reduction of a multiple-time-scale differential system. In addition, a given DAE may result from the reduction of many “synthetic” differential systems. We show that an important property of a contracting DAE system is that the reduced system always contracts faster than any synthetic counterpart. At the same time, there always exists a synthetic system, whose contraction rate is arbitrarily close to that of the DAE. Synthetic systems are useful for the analysis of attraction basins of nonlinear DAE systems. As any rational DAE system can be represented in quadratic form, the Jacobian of the synthetic system can be made affine in the system variables. This allows for scalable techniques to construct attraction basin approximations, based on uniformly negative matrix measure conditions for the synthetic system Jacobian.

Deferrable power-driven demands such as water and thermal ones possess a capability of energy storage which can be exploited to further optimize electric systems. This paper proposes a new optimized scheduling framework for electric grids by simultaneously exploiting the high-inertia thermal dynamics and lossless water storage. Unlike previous ideas in the literature, both water and thermal demands are managed to realize the long-term and short-term load-shifting strategies, respectively. First, distributed water/thermal loads are aggregated where the virtual storage can be represented by battery models. Then, a further optimized scheduling framework is proposed with a mixed-integer nonlinear programing problem. Comparative studies show that the water storage offers outstanding flexibility for electric system via pumps scheduling, especially for the electric load-shifting strategy in a long time-horizon thanks to the lossless water-storage process. Meanwhile, the thermal storage can directly support short-term electric load-shifting to avoid price spikes of electricity. Numerical results show that the proposed method can reduce the total cost of micro-grids by maximizing the usage of renewable energy sources, avoiding price spikes, and reducing dependence on high-cost centralized energy-storage facilities provided that the critical water-energy demands are preserved.

Nonconvexity induced by the nonlinear AC power flow equations challenges solution algorithms for AC optimal power flow (OPF) problems. While significant research efforts have focused on reliably computing high-quality OPF solutions, it is not always clear that there exists a feasible path to reach the desired operating point. Transitioning between operating points while avoiding constraint violations can be challenging since the feasible space of the OPF problem is nonconvex and potentially disconnected. To address this problem, we propose an algorithm that computes a provably feasible path from an initial operating point to a desired operating point. Given an initial feasible point, the algorithm solves a sequence of convex quadratically constrained optimization problems over conservative convex inner approximations of the OPF feasible space. In each iteration, we obtain a new, improved operating point and a feasible transition from the operating point in the previous iteration. In addition to computing a feasible path to a known desired operating point, this algorithm can also be used to improve the operating point locally. Extensive numerical studies on a variety of test cases demonstrate the algorithm and the ability to arrive at a high-quality solution in few iterations.

This paper develops a systematic framework for analyzing how low frequency forced oscillations propagate in electric power systems. Using this framework, the paper shows how to mathematically justify the so-called Dissipating Energy Flow (DEF) forced oscillation source location technique. The DEF's specific deficiencies are pinpointed, and its underlying energy function is analyzed via incremental passivity theory. This analysis is then used to prove that there exists no passivity transformation (i.e. quadratic energy function) which can simultaneously render all components of a lossy classical power system passive. The paper goes on to develop a simulation-free algorithm for predicting the performance of the DEF method in a generalized power system, and it analyzes the passivity of three non-classical load and generation components. The proposed propagation framework and performance algorithm are both tested and illustrated on the IEEE 39-bus New England system and the WECC 179-bus system.