Energy-Related Controllability of Signed Complex Networks With Laplacian Dynamics
- 19 August 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 66 (7) , 3325-3330
Abstract
This paper investigates energy-related controllability of complex networks. Specifically, our objective is to establish controllability characteristics on signed complex networks, where the network units interact via neighbor-based Laplacian feedback and the network admits positive and negative edges to capture cooperative and competitive interactions among these units. The network units can be classified into leaders and followers. This work focuses on characterizing the energy-related controllability in signed networks (i.e., the energy incurred by the leaders in the control of a network). To this end, controllability Gramian based measures are exploited to quantify the difficulty of the control problem on signed networks in terms of the required control energy. Fundamental relationships between these measures and network topology are developed via graph Laplacian to characterize energy-related controllability. It is revealed that, for structurally unbalanced signed graphs, the energy-related controllability is closely related to the diagonal entries of the inverse of the graph Laplacian.Keywords
Funding Information
- AFRL Mathematical Modeling and Optimization Institute (FA9453-19-1-0077)
This publication has 37 references indexed in Scilit:
- Minimal Actuator Placement With Bounds on Control EffortIEEE Transactions on Control of Network Systems, 2015
- Graph Controllability Classes for the Laplacian Leader-Follower DynamicsIEEE Transactions on Automatic Control, 2014
- Controllability Metrics, Limitations and Algorithms for Complex NetworksIEEE Transactions on Control of Network Systems, 2014
- Structural controllability of switched linear systemsAutomatica, 2013
- Input addition and leader selection for the controllability of graph-based systemsAutomatica, 2013
- Controlling Complex Networks: How Much Energy Is Needed?Physical Review Letters, 2012
- Controllability of complex networksNature, 2011
- Interconnection topologies for multi-agent coordination under leader–follower frameworkAutomatica, 2009
- Controllability of Multi-Agent Systems from a Graph-Theoretic PerspectiveSIAM Journal on Control and Optimization, 2009
- Resistance distance and Laplacian spectrumTheoretical Chemistry Accounts, 2003