On the Reachability of Networked Systems

In this paper, we study networks of discrete-time linear time-invariant subsystems. Our focus is on situations where subsystems are connected to each other through a time-invariant topology and where there exists a base-station whose aim is to control the subsystems into any desired destinations. However, the base-station can only communicate with some of the subsystems that we refer to as leaders. There are no direct links between the base-station and the rest of subsystems, known as followers, as they are only able to liaise among themselves and with some of the leaders. The current paper formulates this framework as the well-known reachability problem for linear systems. Then to address this problem, we introduce notions of leader-reachability and base-reachability. We present algebraic conditions under which these notions hold. It turns out that if subsystems are represented by minimal state space representations, then base-reachability always holds. Hence, we focus on leader-reachability and investigate the corresponding conditions in detail. We further demonstrate that when the networked system parameters i.e. subsystems' parameters and interconnection matrices, assume generic values then the whole network is both leader-reachable and base-reachable.

[1]  João Pedro Hespanha,et al.  Linear Systems Theory , 2009 .

[2]  Guangming Xie,et al.  Controllability of multi-agent systems based on agreement protocols , 2009, Science in China Series F: Information Sciences.

[3]  Hai Lin,et al.  A graph theory based characterization of controllability for multi-agent systems with fixed topology , 2008, 2008 47th IEEE Conference on Decision and Control.

[4]  Albert-László Barabási,et al.  Controllability of complex networks , 2011, Nature.

[5]  Mohsen Zamani,et al.  Structural controllability of multi-agent systems , 2009, 2009 American Control Conference.

[6]  EgerstedtMagnus,et al.  Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective , 2009 .

[7]  M. Egerstedt,et al.  Leader-based multi-agent coordination: controllability and optimal control , 2006, 2006 American Control Conference.

[8]  Mehran Mesbahi,et al.  On the controlled agreement problem , 2006, 2006 American Control Conference.

[10]  Bruno Sinopoli,et al.  Distributed control applications within sensor networks , 2003, Proc. IEEE.

[11]  H.G. Tanner,et al.  On the controllability of nearest neighbor interconnections , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[12]  Brian D. O. Anderson,et al.  Zeros of networked systems with time-invariant interconnections , 2014, Autom..

[13]  Chak-Kuen Wong,et al.  A Combinatorial Problem Related to Multimodule Memory Organizations , 1974, JACM.

[14]  S. R. Simanca,et al.  On Circulant Matrices , 2012 .

[15]  Arne G. Dankers.  System Identification in Dynamic Networks , 2014 .

[16]  S. Liberty,et al.  Linear Systems , 2010, Scientific Parallel Computing.

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

[18]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[19]  R. Brockett,et al.  Discretized partial differential equations: Examples of control systems defined on modules , 1974, Autom..

[20]  B. Anderson,et al.  MULTIVARIATE AR SYSTEMS AND MIXED FREQUENCY DATA: G-IDENTIFIABILITY AND ESTIMATION , 2016, Econometric Theory.

[21]  J. Pearson.  Linear multivariable control, a geometric approach , 1977 .

[22]  Hai Lin,et al.  Controllability of Multi-agent Systems with Switching Topology , 2008, 2008 IEEE Conference on Robotics, Automation and Mechatronics.

[23]  João Pedro Hespanha,et al.  A Survey of Recent Results in Networked Control Systems , 2007, Proceedings of the IEEE.

[24]  George J. Pappas,et al.  Stable flocking of mobile agents part I: dynamic topology , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[25]  Meng Ji,et al.  A Graph-Theoretic Characterization of Controllability for Multi-agent Systems , 2007, 2007 American Control Conference.

[26]  Guillermo Sapiro,et al.  Evolutions of Planar Polygons , 1995, Int. J. Pattern Recognit. Artif. Intell..

[27]  Richard M. Murray,et al.  Information flow and cooperative control of vehicle formations , 2004, IEEE Transactions on Automatic Control.

[28]  Hai Lin,et al.  Structural controllability of high order dynamic multi-agent systems , 2010, 2010 IEEE Conference on Robotics, Automation and Mechatronics.

[29]  Aleksandar Ilic,et al.  New results on the energy of integral circulant graphs , 2011, Appl. Math. Comput..

[30]  Mireille E. Broucke,et al.  Formations of vehicles in cyclic pursuit , 2004, IEEE Transactions on Automatic Control.

[31]  Richard M. Murray,et al.  DISTRIBUTED COOPERATIVE CONTROL OF MULTIPLE VEHICLE FORMATIONS USING STRUCTURAL POTENTIAL FUNCTIONS , 2002 .

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

[33]  Ching-tai Lin.  Structural controllability , 1974 .

[34]  M. Egerstedt,et al.  Controllability analysis of multi-agent systems using relaxed equitable partitions , 2010 .