11 January 2013 in IEEE Transactions on Automatic Control
This paper deals with robust synchronization of uncertain multi-agent networks. Given a network with for each of the agents identical nominal linear dynamics, we allow uncertainty in the form of additive perturbations of the transfer matrices of the nominal dynamics. The perturbations are assumed to be stable and bounded in H∞-norm by some a priori given desired tolerance. We derive state space formulas for observer based dynamic protocols that achieve synchronization for all perturbations bounded by this desired tolerance. It is shown that a protocol achieves robust synchronization if and only if each controller from a related finite set of feedback controllers robustly stabilizes a given, single linear system. Our protocols are expressed in terms of real symmetric solutions of certain algebraic Riccati equations and inequalities, and also involve weighting factors that depend on the eigenvalues of the graph Laplacian. For undirected network graphs we show that within the class of such dynamic protocols, a guaranteed achievable tolerance can be obtained that is proportional to the quotient of the second smallest and the largest eigenvalue of the Laplacian. We also extend our results to additive nonlinear perturbations with L2-gain bounded by a given tolerance.
26 February 2014 in IEEE Transactions on Automatic Control
In this technical note, controllability of systems defined on graphs is discussed. We consider the problem of controllability of the network for a family of matrices carrying the structure of an underlying directed graph. A one-to-one correspondence between the set of leaders rendering the network controllable and zero forcing sets is established. To illustrate the proposed results, special cases including path, cycle, and complete graphs are discussed. Moreover, as shown for graphs with a tree structure, the proposed results of the present technical note together with the existing results on the zero forcing sets lead to a minimal leader selection scheme in particular cases.
14 March 2014 in IEEE Transactions on Control of Network Systems
In this paper, we establish a projection-based model reduction method for multiagent systems defined on a graph. Reduced order models are obtained by clustering the vertices (agents) of the underlying communication graph by means of suitable graph partitions. In the reduction process, the spatial structure of the network is preserved and the reduced order models can again be realized as multiagent systems defined on a graph. The agents are assumed to have single-integrator dynamics and the communication graph of the original system is weighted and undirected. The proposed model reduction technique reduces the number of vertices of the graph (which is equal to the dynamic order of the original multi-agent system) and yields a reduced order multiagent system defined on a new graph with a reduced number of vertices. This new graph is a weighted symmetric directed graph. It is shown that if the original multiagent system reaches consensus, then so does the reduced order model. For the case that the clusters are chosen using an almost equitable partition (AEP) of the graph, we obtain an explicit formula for the H2-norm of the error system obtained by comparing the input-output behaviors of the original model and the reduced order model. We also prove that the error obtained by taking an arbitrary partition of the graph is bounded from below by the error obtained using the largest AEP finer than the given partition. The proposed results are illustrated by means of a running example.
26 May 2017 in IEEE Transactions on Automatic Control
In this paper, we contribute a theoretical framework that sheds a new light on the problem of microgrid analysis and control. The starting point is an energy function comprising the “kinetic” energy associated with the elements that emulate the rotating machinery and terms taking into account the reactive power stored in the lines and dissipated on shunt elements. We then shape this energy function with the addition of an adjustable voltage-dependent term, and construct so-called Bregman storage functions satisfying suitable dissipation inequalities. Our choice of the voltage-dependent term depends on the voltage dynamics under investigation. Several microgrid controllers that have similarities or coincide with dynamics already considered in the literature are captured in our incremental energy analysis framework. The twist with respect to existing results is that our incremental storage functions allow for a large signal analysis of the coupled microgrid. This obviates the need for simplifying linearization techniques, and for the restrictive decoupling assumption in which the frequency dynamics is fully separated from the voltage one. A complete Lyapunov stability analysis of the various systems is carried out along with a discussion on their active and reactive power sharing properties.
1 January 2019 in Systems & Control Letters
23 November 2017 in IEEE Transactions on Smart Grid
We present a systematic method for designing distributed generation and demand control schemes for secondary frequency regulation in power networks such that stability and an economically optimal power allocation can be guaranteed. We consider frequency dynamics given by swing equation along with generation, controllable demand, and a secondary control scheme that makes use of local frequency measurements and a locally exchanged signal. A decentralized dissipativity condition is imposed on net power supply variables to provide stability guarantees. Furthermore, economic optimality is achieved by explicit steady state conditions on the generation and controllable demand. A distinctive feature of the proposed stability analysis is the fact that it can cope with generation and demand dynamics that are of general higher order. Moreover, we discuss how the proposed framework captures various classes of power supply dynamics used in recent studies. In case of linear dynamics, the proposed dissipativity condition can be efficiently verified using an appropriate linear matrix inequality. Moreover, it is shown how the addition of a suitable observer layer can relax the requirement for demand measurements in the secondary controller. The efficiency and practicality of the proposed results are demonstrated with simulations on the Northeast Power Coordinating Council (NPCC) 140-bus and a 9-bus system.