Generalising Laplacian controllability of paths

It is well known that if a network topology is a path or line and the states of vertices or nodes evolve according to the consensus policy, then the network is Laplacian controllable by an input connected to its terminal vertex. In this work, a path is regarded as the resulting graph after interconnecting a finite number of two-vertex antiregular graphs and then possibly connecting one more vertex. It is shown that the single-input Laplacian controllability of a path can be extended to the case of interconnecting a finite number of k -vertex antiregular graphs with or without one more vertex appended, for any positive integer k . The methods to interconnect these antiregular graphs and to select the vertex for connecting the single input that renders the network Laplacian controllable are presented as well.

[1]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[2]  R. Merris.  Degree maximal graphs are Laplacian integral , 1994 .

[3]  Shiyu Zhao,et al.  Controllability Degree of Directed Line Networks: Nodal Energy and Asymptotic Bounds , 2018, 2018 European Control Conference (ECC).

[4]  Giuseppe Notarstefano,et al.  Graph reduction based observability conditions for network systems running average consensus algorithms , 2010, 18th Mediterranean Conference on Control and Automation, MED'10.

[5]  Der-Jiunn Deng,et al.  Optimal Charging Control of Energy Storage and Electric Vehicle of an Individual in the Internet of Energy With Energy Trading , 2018, IEEE Transactions on Industrial Informatics.

[6]  R. Bapat.  On the adjacency matrix of a threshold graph , 2013 .

[7]  Russell Merris,et al.  ANTIREGULAR GRAPHS ARE UNIVERSAL FOR TREES , 2003 .

[8]  Alexander Olshevsky,et al.  Minimal Controllability Problems , 2013, IEEE Transactions on Control of Network Systems.

[9]  Jason J. Molitierno.  Applications of Combinatorial Matrix Theory to Laplacian Matrices of Graphs , 2012 .

[10]  Magnus Egerstedt,et al.  Graph Theoretic Methods in Multiagent Networks , 2010, Princeton Series in Applied Mathematics.

[11]  M. Kanat Camlibel,et al.  Upper and Lower Bounds for Controllable Subspaces of Networks of Diffusively Coupled Agents , 2014, IEEE Transactions on Automatic Control.

[12]  Magnus Egerstedt,et al.  Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective , 2009, SIAM J. Control. Optim..

[13]  R. Merris.  Laplacian graph eigenvectors , 1998 .

[14]  João P. S. Catalão,et al.  Coordinated Operation of a Neighborhood of Smart Households Comprising Electric Vehicles, Energy Storage and Distributed Generation , 2016, IEEE Transactions on Smart Grid.

[15]  Frede Blaabjerg,et al.  A Review of Internet of Energy Based Building Energy Management Systems: Issues and Recommendations , 2018, IEEE Access.

[16]  Giuseppe Notarstefano,et al.  Controllability and Observability of Grid Graphs via Reduction and Symmetries , 2012, IEEE Transactions on Automatic Control.

[17]  Chi-Tsong Chen,et al.  Linear System Theory and Design , 1995 .

[18]  Bahman Gharesifard,et al.  Graph Controllability Classes for the Laplacian Leader-Follower Dynamics , 2015, IEEE Transactions on Automatic Control.

[19]  Giuseppe Notarstefano,et al.  On the Reachability and Observability of Path and Cycle Graphs , 2011, IEEE Transactions on Automatic Control.

[20]  Cesar O. Aguilar,et al.  Laplacian controllability classes for threshold graphs , 2015 .

[21]  Der-Jiunn Deng,et al.  Peak Load Shifting in the Internet of Energy With Energy Trading Among End-Users , 2017, IEEE Access.

[22]  Shun-Pin Hsu.  Controllability of the multi-agent system modeled by the threshold graph with one repeated degree , 2016, Syst. Control. Lett..

[23]  Shun-Pin Hsu,et al.  Constructing a controllable graph under edge constraints , 2017, Syst. Control. Lett..

[24]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[25]  Ming Cao,et al.  Interacting with Networks: How Does Structure Relate to Controllability in Single-Leader, Consensus Networks? , 2012, IEEE Control Systems.

[26]  Mehran Mesbahi,et al.  On the Controllability Properties of Circulant Networks , 2013, IEEE Transactions on Automatic Control.

[27]  Mohammed Moness,et al.  A Survey of Cyber-Physical Advances and Challenges of Wind Energy Conversion Systems: Prospects for Internet of Energy , 2016, IEEE Internet of Things Journal.

[28]  Fredrik Wallin,et al.  A Comprehensive Review of Smart Energy Meters in Intelligent Energy Networks , 2016, IEEE Internet of Things Journal.

[29]  Shun-Pin Hsu.  A necessary and sufficient condition for the controllability of single-leader multi-chain systems , 2017 .

[30]  Shun-Pin Hsu,et al.  Laplacian controllable graphs based on connecting two antiregular graphs , 2018, IET Control Theory & Applications.

[31]  Shivkumar Kalyanaraman.  Back to the Future: Lessons for Internet of Energy Networks , 2016, IEEE Internet Computing.