arXiv subjects

Enrique Mallada

Publications and source records attributed to Enrique Mallada.

At least 73 records · Page 4Linked to original sources

arXiv2019

Dynamics Concentration of Large-Scale Tightly-Connected Networks

The ability to achieve coordinated behavior --engineered or emergent-- on networked systems has attracted widespread interest over several fields. This has led to remarkable advances on the development of a theoretical understanding of the conditions under which agents within a network can reach agreement (consensus) or develop coordinated behaviors such as synchronization. However, fewer advances have been made toward explaining another commonly observed phenomena in tightly-connected networks systems: output responses of nodes in the networks are almost identical to each other despite heterogeneity in their individual dynamics. In this paper, we leverage tools from high-dimensional probability to provide an initial answer to this phenomena. More precisely, we show that for linear networks of nodal random transfer functions, as the network size and connectivity grows, every node in the network follows the same response to an input or disturbance --irrespectively of the source of this input. We term this behavior as dynamics concentration since it stems from the fact that the network transfer matrix uniformly converges in probability, i.e., it concentrates, to a unique dynamic response determined by the distribution of the random transfer function of each node. We further discuss the implications of our analysis in the context of model reduction and robustness, and provide numerical evidence that similar phenomena occur in small deterministic networks over a properly defined frequency band.

eess.SY↗

arXiv2019

Adversarial Model Predictive Control via Second-Order Cone Programming

We study the problem of designing attacks to safety-critical systems in which the adversary seeks to maximize the overall system cost within a model predictive control framework. Although in general this problem is NP-hard, we characterize a family of problems that can be solved in polynomial time via a second-order cone programming relaxation. In particular, we show that positive systems fall under this family. We provide examples demonstrating the design of optimal attacks on an autonomous vehicle and a microgrid.

math.OC↗

arXiv2019

Dynamic Droop Control in Low-inertia Power Systems

A widely embraced approach to mitigate the dynamic degradation in low-inertia power systems is to mimic generation response using grid-connected inverters to restore the grid's stiffness. In this paper, we seek to challenge this approach and advocate for a principled design based on a systematic analysis of the performance trade-offs of inverter-based frequency control. With this aim, we perform a qualitative and quantitative study comparing the effect of conventional control strategies --droop control (DC) and virtual inertia (VI)-- on several performance metrics induced by $\mathcal L_2$ and $\mathcal L_\infty$ signal norms. By extending a recently proposed modal decomposition method, we capture the effect of step and stochastic power disturbances, and frequency measurement noise, on the overall transient and steady-state behavior of the system. Our analysis unveils several limitations of these solutions, such as the inability of DC to improve dynamic frequency response without increasing steady-state control effort, or the large frequency variance that VI introduces in the presence of measurement noise. We further propose a novel dynam-i-c Droop controller (iDroop) that overcomes the limitations of DC and VI. More precisely, we show that iDroop can be tuned to achieve high noise rejection, fast system-wide synchronization, or frequency overshoot (Nadir) elimination without affecting the steady-state control effort share, and propose a tuning recommendation that strikes a balance among these objectives. Extensive numerical experimentation shows that the proposed tuning is effective even when our proportionality assumptions are not valid, and that the particular tuning used for Nadir elimination strikes a good trade-off among various performance metrics.

eess.SY↗

arXiv2019

Robust Scale-Free Synthesis for Frequency Control in Power Systems

The AC frequency in electrical power systems is conventionally regulated by synchronous machines. The gradual replacement of these machines by asynchronous renewable-based generation, which provides little or no frequency control, increases system uncertainty and the risk of instability. This imposes hard limits on the proportion of renewables that can be integrated into the system. In this paper we address this issue by developing a framework for performing frequency control in power systems with arbitrary mixes of conventional and renewable generation. Our approach is based on a robust stability criterion that can be used to guarantee the stability of a full power system model on the basis of a set of decentralised tests, one for each component in the system. It can be applied even when using detailed heterogeneous component models, and can be verified using several standard frequency response, state-space, and circuit theoretic analysis tools. Furthermore the stability guarantees hold independently of the operating point, and remain valid even as components are added to and removed from the grid. By designing decentralised controllers for individual components to meet these decentralised tests, every component can contribute to the regulation of the system frequency in a simple and provable manner. Notably, our framework certifies the stability of several existing (non-passive) power system control schemes and models, and allows for the study of robustness with respect to delays.

math.OC↗

arXiv2019

Global analysis of synchronization performance for power systems: bridging the theory-practice gap

The issue of synchronization in the power grid is receiving renewed attention, as new energy sources with different dynamics enter the picture. Global metrics have been proposed to evaluate performance and analyzed under highly simplified assumptions. In this paper, we extend this approach to more realistic network scenarios and more closely connect it with metrics used in power engineering practice. In particular, our analysis covers networks with generators of heterogeneous ratings and richer dynamic models of machines. Under a suitable proportionality assumption in the parameters, we show that the step response of bus frequencies can be decomposed in two components. The first component is a {system-wide frequency} that captures the aggregate grid behavior, and the residual component represents the individual bus frequency deviations from the aggregate. Using this decomposition, we define --and compute in closed form-- several metrics that capture dynamic behaviors that are of relevance for power engineers. In particular, using the \emph{system frequency}, we define industry-style metrics (Nadir, RoCoF) that are evaluated through a representative machine. We further use the norm of the residual component to define a \emph{synchronization cost} that can appropriately quantify inter-area oscillations. Finally, we employ robustness analysis tools to evaluate deviations from our proportionality assumption. We show that the system frequency still captures the grid steady-state deviation, and becomes an accurate reduced-order model of the grid as the network connectivity grows. Simulation studies with practically relevant data are included to validate the theory and further illustrate the impact of network structure and parameters on synchronization. Our analysis gives conclusions of practical interest, sometimes challenging the conventional wisdom in the field.

eess.SY↗

arXiv2019

Global performance metrics for synchronization of heterogeneously rated power systems: The role of machine models and inertia

A recent trend in control of power systems has sought to quantify the synchronization dynamics in terms of a global performance metric, compute it under very simplified assumptions, and use it to gain insight on the role of system parameters, in particular, inertia. In this paper, we wish to extend this approach to more realistic scenarios, by incorporating the heterogeneity of machine ratings, more complete machine models, and also to more closely map it to classical power engineering notions such as Nadir, Rate of Change of Frequency (RoCoF), and inter-area oscillations. We consider the system response to a step change in power excitation, and define the system frequency as a weighted average of generator frequencies (with weights proportional to each machine's rating); we characterize Nadir and RoCoF by the $L_\infty$ norm of the system frequency and its derivative, respectively, and inter-areas oscillations by the $L_2$ norm of the error of the vector of bus frequencies w.r.t. the system frequency. For machine models where the dynamic parameters (inertia, damping, etc.) are proportional to rating, we analytically compute these norms and use them to show that the role of inertia is more nuanced than in the conventional wisdom. With the classical swing dynamics, inertia constant plays a secondary role in performance. It is only when the turbine dynamics are introduced that the benefits of inertia become more prominent.

math.OC↗

arXiv2019

Online Inventory Management with Application to Energy Procurement in Data Centers

Motivated by the application of energy storage management in electricity markets, this paper considers the problem of online linear programming with inventory management constraints. Specifically, a decision maker should satisfy some units of an asset as her demand, either form a market with time-varying price or from her own inventory. The decision maker is presented a price in slot-by-slot manner, and must immediately decide the purchased amount with the current price to cover the demand or to store in inventory for covering the future demand. The inventory has a limited capacity and its critical role is to buy and store assets at low price and use the stored assets to cover the demand at high price. The ultimate goal of the decision maker is to cover the demands while minimizing the cost of buying assets from the market. We propose BatMan, an online algorithm for simple inventory models, and BatManRate, an extended version for the case with rate constraints. Both BatMan and BatManRate achieve optimal competitive ratios, meaning that no other online algorithm can achieve a better theoretical guarantee. To illustrate the results, we use the proposed algorithms to design and evaluate energy procurement and storage management strategies for data centers with a portfolio of energy sources including the electric grid, local renewable generation, and energy storage systems.

cs.DS↗

arXiv2018

Robust Decentralized Secondary Frequency Control in Power Systems: Merits and Trade-Offs

Frequency restoration in power systems is conventionally performed by broadcasting a centralized signal to local controllers. As a result of the energy transition, technological advances, and the scientific interest in distributed control and optimization methods, a plethora of distributed frequency control strategies have been proposed recently that rely on communication amongst local controllers. In this paper we propose a fully decentralized leaky integral controller for frequency restoration that is derived from a classic lag element. We study steady-state, asymptotic optimality, nominal stability, input-to-state stability, noise rejection, transient performance, and robustness properties of this controller in closed loop with a nonlinear and multivariable power system model. We demonstrate that the leaky integral controller can strike an acceptable trade-off between performance and robustness as well as between asymptotic disturbance rejection and transient convergence rate by tuning its DC gain and time constant. We compare our findings to conventional decentralized integral control and distributed-averaging-based integral control in theory and simulations.

math.OC↗

arXiv2018

Voltage Collapse Stabilization: A Game Theory Viewpoint

Voltage collapse is a type of blackout-inducing dynamic instability that occurs when the power demand exceeds the maximum power that can be transferred through the network. The traditional (preventive) approach to avoid voltage collapse is based on ensuring that the network never reaches its maximum capacity. However, such an approach leads to inefficiencies as it prevents operators to fully utilize the network resources and does not account for unprescribed events. To overcome this limitation, this paper seeks to initiate the study of voltage collapse stabilization. More precisely, for a DC network, we formulate the problem of voltage stability as a dynamic problem where each load seeks to achieve a constant power consumption by updating its conductance as the voltage changes. We show that such a system can be interpreted as a dynamic game, where each player (load) seeks to myopically maximize their utility, and where every stable power flow solution amounts to a Local Nash Equilibrium. Using this framework, we show that voltage collapse is equivalent to the non-existence of a Local Nash Equilibrium in the game and, as a result, it is caused by the lack of cooperation between loads. Finally, we propose a Voltage Collapse Stabilizer (VCS) controller that uses (flexible) loads that are willing to cooperate and provides a fair allocation of the curtailed demand. Our solution stabilizes voltage collapse even in the presence of non-cooperative loads. Numerical simulations validate several features of our controllers.

eess.SY↗

arXiv2018

Sparse Recovery over Graph Incidence Matrices

Classical results in sparse recovery guarantee the exact reconstruction of $s$-sparse signals under assumptions on the dictionary that are either too strong or NP-hard to check. Moreover, such results may be pessimistic in practice since they are based on a worst-case analysis. In this paper, we consider the sparse recovery of signals defined over a graph, for which the dictionary takes the form of an incidence matrix. We derive necessary and sufficient conditions for sparse recovery, which depend on properties of the cycles of the graph that can be checked in polynomial time. We also derive support-dependent conditions for sparse recovery that depend only on the intersection of the cycles of the graph with the support of the signal. Finally, we exploit sparsity properties on the measurements and the structure of incidence matrices to propose a specialized sub-graph-based recovery algorithm that outperforms the standard $\ell_1$-minimization approach.

cs.IT↗

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↗

arXiv2017

An integral quadratic constraint framework for real-time steady-state optimization of linear time-invariant systems

Achieving optimal steady-state performance in real-time is an increasingly necessary requirement of many critical infrastructure systems. In pursuit of this goal, this paper builds a systematic design framework of feedback controllers for Linear Time-Invariant (LTI) systems that continuously track the optimal solution of some predefined optimization problem. The proposed solution can be logically divided into three components. The first component estimates the system state from the output measurements. The second component uses the estimated state and computes a drift direction based on an optimization algorithm. The third component computes an input to the LTI system that aims to drive the system toward the optimal steady-state. We analyze the equilibrium characteristics of the closed-loop system and provide conditions for optimality and stability. Our analysis shows that the proposed solution guarantees optimal steady-state performance, even in the presence of constant disturbances. Furthermore, by leveraging recent results on the analysis of optimization algorithms using integral quadratic constraints (IQCs), the proposed framework is able to translate input-output properties of our optimization component into sufficient conditions, based on linear matrix inequalities (LMIs), for global exponential asymptotic stability of the closed loop system. We illustrate the versatility of our framework using several examples.

math.OC↗

arXiv2017

High-voltage solution in radial power networks:Existence, properties and equivalent algorithms

The AC power flow equations describe the steady-state behavior of the power grid. While many algorithms have been developed to compute solutions to the power flow equations, few theoretical results are available characterizing when such solutions exist, or when these algorithms can be guaranteed to converge. In this paper, we derive necessary and sufficient conditions for the existence and uniqueness of a power flow solution in balanced radial distribution networks with homogeneous (uniform $R/X$ ratio) distribution lines. We study three distinct solution methods: fixed point iterations}, convex relaxations, and energy functions we show that the three algorithms successfully find a solution if and only if a solution exists. Moreover, all three algorithms always find the unique high-voltage solution to the power flow equations, the existence of which we formally establish.}%, which can be formally defined as the high-voltage solution -- any other solution of the power flow equations has smaller or equal voltage magnitudes at every bus. At this solution, we prove that (i) voltage magnitudes are increasing functions of the reactive power injections, (ii) the solution is a continuous function of the injections, and (iii) the solution is the last one to vanish as the system is loaded past the feasibility boundary.

math.OC↗

arXiv2017

Understanding the Inefficiency of Security-Constrained Economic Dispatch

The security-constrained economic dispatch (SCED) problem tries to maintain the reliability of a power network by ensuring that a single failure does not lead to a global outage. The previous research has mainly investigated SCED by formulating the problem in different modalities, e.g. preventive or corrective, and devising efficient solutions for SCED. In this paper, we tackle a novel and important direction, and analyze the economic cost of incorporating security constraints in economic dispatch. Inspired by existing inefficiency metrics in game theory and computer science, we introduce notion of price of security as a metric that formally characterizes the economic inefficiency of security-constrained economic dispatch as compared to the original problem without security constraints. Then, we focus on the preventive approach in a simple topology comprising two buses and two lines, and investigate the impact of generation availability and demand distribution on the price of security. Moreover, we explicitly derive the worst-case input instance that leads to the maximum price of security. By extensive experimental study on two test-cases, we verify the analytical results and provide insights for characterizing the price of security in general networks.

eess.SY↗

arXiv2017

The role of convexity on saddle-point dynamics: Lyapunov function and robustness

This paper studies the projected saddle-point dynamics associated to a convex-concave function, which we term saddle function. The dynamics consists of gradient descent of the saddle function in variables corresponding to convexity and (projected) gradient ascent in variables corresponding to concavity. We examine the role that the local and/or global nature of the convexity-concavity properties of the saddle function plays in guaranteeing convergence and robustness of the dynamics. Under the assumption that the saddle function is twice continuously differentiable, we provide a novel characterization of the omega-limit set of the trajectories of this dynamics in terms of the diagonal blocks of the Hessian. Using this characterization, we establish global asymptotic convergence of the dynamics under local strong convexity-concavity of the saddle function. When strong convexity-concavity holds globally, we establish three results. First, we identify a Lyapunov function (that decreases strictly along the trajectory) for the projected saddle-point dynamics when the saddle function corresponds to the Lagrangian of a general constrained convex optimization problem. Second, for the particular case when the saddle function is the Lagrangian of an equality-constrained optimization problem, we show input-to-state stability of the saddle-point dynamics by providing an ISS Lyapunov function. Third, we use the latter result to design an opportunistic state-triggered implementation of the dynamics. Various examples illustrate our results.

math.OC↗

arXiv2017

Performance tradeoffs of dynamically controlled grid-connected inverters in low inertia power systems

Implementing frequency response using grid-connected inverters is one of the popular proposed alternatives to mitigate the dynamic degradation experienced in low inertia power systems. However, such solution faces several challenges as inverters do not intrinsically possess the natural response to power fluctuations that synchronous generators have. Thus, to synthetically generate this response, inverters need to take frequency measurements, which are usually noisy, and subsequently make changes in the output power, which are therefore delayed. This paper explores the system-wide performance tradeoffs that arise when measurement noise, power disturbances, and delayed actions are considered in the design of dynamic controllers for grid-connected inverters. Using a recently proposed dynamic droop (iDroop) control for grid-connected inverters, which is inspired by classical first order lead-lag compensation, we show that the sets of parameters that result in highest noise attenuation, power disturbance mitigation, and delay robustness do not necessarily have a common intersection. In particular, lead compensation is desired in systems where power disturbances are the predominant source of degradation, while lag compensation is a better alternative when the system is dominated by delays or frequency noise. Our analysis further shows that iDroop can outperform the standard droop alternative in both joint noise and disturbance mitigation, and delay robustness.

eess.SY↗

arXiv2016

iDroop: A dynamic droop controller to decouple power grid's steady-state and dynamic performance

This paper presents a novel Dynam-i-c Droop (iDroop) control mechanism to perform primary frequency control with gird-connected inverters that improves the network dynamic performance. The work is motivated by the dynamic degradation experienced by the power grid due to the increase in asynchronous inverted-based generation. We show that the widely suggested virtual inertia solution suffers from unbounded noise amplification (infinite $\mathcal H_2$ norm) when measurement noise is considered. This suggests that virtual inertia could potentially further degrade the grid performance once broadly deployed. This motivates the proposed solution in this paper that overcomes the limitations of virtual inertia controllers while sharing the same advantages of traditional droop control. In particular, our iDroop controllers are decentralized, rebalance supply and demand, and provide power sharing. Furthermore, our solution can improve the dynamic performance without affecting the steady state solution. Our algorithm can be incrementally deployed and can be guaranteed to be stable using a decentralized sufficient stability condition on the parameter values. We illustrate several features of our solution using numerical simulations.

math.OC↗

arXiv2016

Decentralized Robust Inverter-based Control in Power Systems

This paper develops a novel framework for power system stability analysis, that allows for the decentralized design of inverter based controllers. The method requires that each individual inverter satisfies a standard $H^\infty$ design requirement. Critically each requirement depends only on the dynamics of the components and inverters at each individual bus and the aggregate susceptance of the transmission lines connected to it. The method is both robust to network and delay uncertainties, as well as heterogeneous network components, and when no network information is available it reduces to the standard decentralized passivity sufficient condition for stability. We illustrate the novelty and strength of our approach by studying the design of inverter-based control laws in the presence of delays.

math.OC↗