arXiv subjects

John W. Simpson-Porco

Publications and source records attributed to John W. Simpson-Porco.

At least 37 records · Page 2Linked to original sources

arXiv2021

Low-Gain Stability of Projected Integral Control for Input-Constrained Discrete-Time Nonlinear Systems

We consider the problem of zeroing an error output of a nonlinear discrete-time system in the presence of constant exogenous disturbances, subject to hard convex constraints on the input signal. The design specification is formulated as a variational inequality, and we adapt a forward-backward splitting algorithm to act as an integral controller which ensures that the input constraints are met at each time step. We establish a low-gain stability result for the closed-loop system when the plant is exponentially stable, generalizing previously known results for integral control of discrete-time systems. Specifically, it is shown that if the composition of the plant equilibrium input-output map and the integral feedback gain is strongly monotone, then the closed-loop system is exponentially stable for all sufficiently small integral gains. The method is illustrated via application to a four-tank process.

math.OC↗

arXiv2020

Analysis and Synthesis of Low-Gain Integral Controllers for Nonlinear Systems

Relaxed conditions are given for stability of a feedback system consisting of an exponentially stable multi-input multi-output nonlinear plant and an integral controller. Roughly speaking, it is shown that if the composition of the plant equilibrium input-output map and the integral feedback gain is infinitesimally contracting, then the closed-loop system is exponentially stable if the integral gain is sufficiently low. The main result is illustrated with an application arising in frequency control of AC power systems. We demonstrate how the contraction condition can be checked computationally via semidefinite programming, and how integral gain matrices can be synthesized via convex optimization to achieve robust L2 performance in the presence of nonlinearity and uncertainty.

math.OC↗

arXiv2020

Quadratic Performance Analysis of Secondary Frequency Controllers

This paper investigates the input-output performance of secondary frequency controllers through the control-theoretic notion of $H_2$ norms. We consider a quadratic objective accounting for the cost of reserve procurement and provide exact analytical formulae for the performance of continuous-time aggregated averaging controllers. Then, we contrast it with distributed averaging controllers -- seeking optimality conditions such as identical marginal costs -- and primal-dual controllers which have gained attention as systematic techniques to design distributed algorithms solving convex optimization problems. Our conclusion is that while the performance of aggregated averaging controllers, such as gather & broadcast, is independent of the system size and driven predominantly by the control gain, the plain vanilla closed-loop primal-dual controllers scale poorly with size and do not offer any improvement over feedforward primal-dual controllers. Finally, distributed averaging-based controllers scale sub-linearly with size and are independent of system size in the high-gain limit.

math.OC↗

arXiv2020

A Dynamic Stability and Performance Analysis of Automatic Generation Control

Automatic generation control (AGC) is one of the most important coordinated control systems present in modern interconnected power systems. Despite being heavily studied, no interconnected dynamic stability and performance analysis of AGC is available in the literature. This paper presents such an analysis for a class of multi-area interconnected nonlinear power systems, providing a nonlinear stability proof and examining dynamic performance from the perspectives of non-interactive tuning, response speed, and sensitivity to disturbances. The key insight is that dynamic stability and performance can be rigorously captured by a reduced dynamic model, which depends only on the AGC controller parameters and on the area frequency characteristic constants. Our analytical results clarify some of the historical controversy concerning the tuning of frequency bias constants in AGC for dynamic stability and performance, and are validated by simulations on a detailed test system.

math.OC↗

arXiv2020

Linear-Convex Optimal Steady-State Control

We consider the problem of designing a feedback controller for a multivariable linear time-invariant system which regulates an arbitrary system output to the solution of an equality-constrained convex optimization problem despite unknown constant exogenous disturbances; we term this the linear-convex optimal steady-state (OSS) control problem. We introduce the notion of an optimality model, and show that the existence of an optimality model is sufficient to reduce the OSS control problem to a stabilization problem. This yields a constructive design framework for optimal steady-state control that unifies and extends existing design methods in the literature. We illustrate the approach via an application to optimal frequency control of power networks, where our methodology recovers centralized and distributed controllers reported in the recent literature.

math.OC↗

arXiv2020

On Stability of Distributed-Averaging Proportional-Integral Frequency Control in Power Systems

Distributed consensus-based controllers for optimal secondary frequency regulation of microgrids and power systems have received substantial attention in recent years. This paper provides a Lyapunov-based proof that, under a time-scale separation, these control schemes are stabilizing for a wide class of nonlinear power system models, and under weak assumptions on (i) the objective functions used for resource allocation, and (ii) the graph topology describing communication between agents in the consensus protocol. The results are illustrated via simulation on a detailed test system.

math.OC↗

arXiv2019

Towards robustness guarantees for feedback-based optimization

Feedback-based online optimization algorithms have gained traction in recent years because of their simple implementation, their ability to reject disturbances in real time, and their increased robustness to model mismatch. While the robustness properties have been observed both in simulation and experimental results, the theoretical analysis in the literature is mostly limited to nominal conditions. In this work, we propose a framework to systematically assess the robust stability of feedback-based online optimization algorithms. We leverage tools from monotone operator theory, variational inequalities and classical robust control to obtain tractable numerical tests that guarantee robust convergence properties of online algorithms in feedback with a physical system, even in the presence of disturbances and model uncertainty. The results are illustrated via an academic example and a case study of a power distribution system.

math.OC↗

arXiv2018

Input-Output Performance of Linear-Quadratic Saddle-Point Algorithms with Application to Distributed Resource Allocation Problems

Saddle-point or primal-dual methods have recently attracted renewed interest as a systematic technique to design distributed algorithms which solve convex optimization problems. When implemented online for streaming data or as dynamic feedback controllers, these algorithms become subject to disturbances and noise; convergence rates provide incomplete performance information, and quantifying input-output performance becomes more important. We analyze the input-output performance of the continuous-time saddle-point method applied to linearly constrained quadratic programs, providing explicit expressions for the saddle-point H2 norm under a relevant input-output configuration. We then proceed to derive analogous results for regularized and augmented versions of the saddle-point algorithm. We observe some rather peculiar effects -- a modest amount of regularization significantly improves the transient performance, while augmentation does not necessarily offer improvement. We then propose a distributed dual version of the algorithm which overcomes some of the performance limitations imposed by augmentation. Finally, we apply our results to a resource allocation problem to compare the input-output performance of various centralized and distributed saddle-point implementations and show that distributed algorithms may perform as well as their centralized counterparts.

math.OC↗

arXiv2018

Optimal Steady-State Control for Linear Time-Invariant Systems

We consider the problem of designing a feedback controller that guides the input and output of a linear time-invariant system to a minimizer of a convex optimization problem. The system is subject to an unknown disturbance that determines the feasible set defined by the system equilibrium constraints. Our proposed design enforces the Karush-Kuhn-Tucker optimality conditions in steady-state without incorporating dual variables into the controller. We prove that the input and output variables achieve optimality in equilibrium and outline two procedures for designing controllers that stabilize the closed-loop system. We explore key ideas through simple examples and simulations.

math.OC↗

arXiv2018

Resilient Estimation and Control on $k$-Nearest Neighbor Platoons: A Network-Theoretic Approach

This paper is concerned with the network-theoretic properties of so-called $k$-nearest neighbor intelligent vehicular platoons, where each vehicle communicates with $k$ vehicles, both in front and behind. The network-theoretic properties analyzed in this paper play major roles in quantifying the resilience and robustness of three generic distributed estimation and control algorithms against communication failures and disturbances, namely resilient distributed estimation, resilient distributed consensus, and robust network formation. Based on the results for the connectivity measures of the $k$-nearest neighbor platoon, we show that extending the traditional platooning topologies (which were based on interacting with nearest neighbors) to $k$-nearest neighbor platoons increases the resilience of distributed estimation and control algorithms to both communication failures and disturbances. Finally, we discuss how the performance of each algorithm scales with the size of the vehicle platoon.

math.OC↗

arXiv2018

Equilibrium-Independent Dissipativity with Quadratic Supply Rates

Equilibrium-independent dissipativity (EID) is a recently introduced system property which requires a system to be dissipative with respect to any forced equilibrium configuration. This paper is a detailed examination of EID with quadratic supply rates for a common class of nonlinear control-affine systems. We provide an algebraic characterization of EID for such systems in the spirit of the Hill-Moylan lemma, where the usual stability condition is replaced by an incremental stability condition. Based on this characterization, we state results concerning internal stability, feedback stability, and absolute stability of EID systems. Finally, we study EID for discrete-time systems, providing the relevant definitions and an analogous Hill-Moylan-type characterization. Results for both continuous-time and discrete-time systems are illustrated through examples on physical systems and convex optimization algorithms.

math.OC↗

arXiv2017

Lossy DC Power Flow

The DC Power Flow approximation has been widely used for decades in both industry and academia due to its computational speed and simplicity, but suffers from inaccuracy, in part due to the assumption of a lossless network. Here we present a natural extension of the DC Power Flow to lossy networks. Our approach is based on reformulating the lossy active power flow equations into a novel fixed-point equation, and iterating this fixed-point mapping to generate a sequence of improving estimates for the active power flow solution. Each iteration requires the solution of a standard DC Power Flow problem with a modified vector of power injections. The first iteration returns the standard DC Power Flow, and one or two additional iterations yields a one or two order-of-magnitude improvement in accuracy. For radial networks, we give explicit conditions on the power flow data which guarantee (i) that the active power flow equations possess a unique solution, and (ii) that our iteration converges exponentially and monotonically to this solution. For meshed networks, we extensively test our results via standard power flow cases.

math.OC↗

arXiv2017

A Theory of Solvability for Lossless Power Flow Equations -- Part I: Fixed-Point Power Flow

This two-part paper details a theory of solvability for the power flow equations in lossless power networks. In Part I, we derive a new formulation of the lossless power flow equations, which we term the fixed-point power flow. The model is stated for both meshed and radial networks, and is parameterized by several graph-theoretic matrices -- the power network stiffness matrices -- which quantify the internal coupling strength of the network. The model leads immediately to an explicit approximation of the high-voltage power flow solution. For standard test cases, we find that iterates of the fixed-point power flow converge rapidly to the high-voltage power flow solution, with the approximate solution yielding accurate predictions near base case loading. In Part II, we leverage the fixed-point power flow to study power flow solvability, and for radial networks we derive conditions guaranteeing the existence and uniqueness of a high-voltage power flow solution. These conditions (i) imply exponential convergence of the fixed-point power flow iteration, and (ii) properly generalize the textbook two-bus system results.

math.OC↗

arXiv2017

A Theory of Solvability for Lossless Power Flow Equations -- Part II: Conditions for Radial Networks

This two-part paper details a theory of solvability for the power flow equations in lossless power networks. In Part I, we derived a new formulation of the lossless power flow equations, which we term the fixed-point power flow. The model is parameterized by several graph-theoretic matrices -- the power network stiffness matrices -- which quantify the internal coupling strength of the network. In Part II, we leverage the fixed-point power flow to study power flow solvability. For radial networks, we derive parametric conditions which guarantee the existence and uniqueness of a high-voltage power flow solution, and construct examples for which the conditions are also necessary. Our conditions (i) imply convergence of the fixed-point power flow iteration, (ii) unify and extend recent results on solvability of decoupled power flow, (iii) directly generalize the textbook two-bus system results, and (iv) provide new insights into how the structure and parameters of the grid influence power flow solvability.

math.OC↗

arXiv2017

System-Theoretic Performance Metrics for Low-Inertia Stability of Power Networks

As bulk synchronous generators in the power grid are replaced by distributed generation interfaced through power electronics, inertia is removed from the system, prompting concerns over grid stability. Different metrics are available for quantifying grid stability and performance; however, no theoretical results are available comparing and contrasting these metrics. This paper presents a rigorous system-theoretic study of performance metrics for low-inertia stability. For networks with uniform parameters, we derive explicit expressions for the eigenvalue damping ratios, and for the $\mathcal{H}_{2}$ and $\mathcal{H}_{\infty}$ norms of the linearized swing dynamics, from external power disturbances to different phase/frequency performance outputs.These expressions show the dependence of system performance on inertia constants, damping constants, and on the grid topology. Surprisingly, we find that the $\mathcal{H}_2$ and $\mathcal{H}_{\infty}$ norms can display contradictory behavior as functions of the system inertia, indicating that low-inertia performance depends strongly on the chosen performance metric.

math.OC↗

arXiv2016

A Graph Theoretic Approach to the Robustness of k-Nearest Neighbor Vehicle Platoons

We consider a graph theoretic approach to the performance and robustness of a platoon of vehicles, where each vehicle communicates with its $k$-nearest neighbors. In particular, we quantify the platoon's stability margin, robustness to disturbances (in terms of system $\mathcal{H}_{\infty}$ norm), and maximum delay tolerance via graph-theoretic notions such as nodal degrees and (grounded) Laplacian matrix eigenvalues. Our results show that there is a trade-off between robustness to time delay and robustness to disturbances. Both first-order dynamics (reference velocity tracking) and second-order dynamics (controlling inter-vehicular distance) are analyzed in this direction. Theoretical contributions are confirmed via simulation results.

math.OC↗

arXiv2016

Improving performance of droop-controlled microgrids through distributed PI-control

This paper investigates transient performance of inverter-based microgrids in terms of the resistive power losses incurred in regulating frequency under persistent stochastic disturbances. We model the inverters as second-order oscillators and compare two algorithms for frequency regulation: the standard frequency droop controller and a distributed proportional-integral (PI) controller. The transient power losses can be quantified using an input-output H2 norm. We show that the distributed PI-controller, which has previously been proposed for secondary frequency control (the elimination of static errors), also has the potential to significantly improve performance by reducing transient power losses. This loss reduction is shown to be larger in a loosely interconnected network than in a highly interconnected one, whereas losses do not depend on connectivity if standard droop control is employed. Moreover, our results indicate that there is an optimal tuning of the distributed PI-controller for loss reduction. Overall, our results provide an additional argument in favor of distributed algorithms for secondary frequency control in microgrids.

math.OC↗

arXiv2016

Distributed Monitoring of Voltage Collapse Sensitivity Indices

The assessment of voltage stability margins is a promising direction for wide-area monitoring systems. Accurate monitoring architectures for long-term voltage instability are typically centralized and lack scalability, while completely decentralized approaches relying on local measurements tend towards inaccuracy. Here we present distributed linear algorithms for the online computation of voltage collapse sensitivity indices. The computations are collectively performed by processors embedded at each bus in the smart grid, using synchronized phasor measurements and communication of voltage phasors between neighboring buses. Our algorithms provably converge to the proper index values, as would be calculated using centralized information, but but do not require any central decision maker for coordination. Modifications of the algorithms to account for generator reactive power limits are discussed. We illustrate the effectiveness of our designs with a case study of the New England 39 bus system.

math.OC↗