Controllability decompositions of networked systems through quotient graphs

In this paper we study decentralized, networked systems whose interaction dynamics are given by a nearest-neighbor averaging rule. By letting one node in the network take on the role of a leader in the sense that this node provides the control input to the entire system, we can ask questions concerning the controllability. In particular, we show that the controllable subspaces associated with such systems have a direct, graph theoretic interpretation in terms of so-called quotient graphs, providing us with a smaller, approximate bisimulation of the original network.

[1]  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).

[2]  Antoine Girard,et al.  Approximation Metrics for Discrete and Continuous Systems , 2006, IEEE Transactions on Automatic Control.

[3]  Sonia Martínez,et al.  Robust rendezvous for mobile autonomous agents via proximity graphs in arbitrary dimensions , 2006, IEEE Transactions on Automatic Control.

[4]  J.N. Tsitsiklis,et al.  Convergence Rates in Distributed Consensus and Averaging , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[5]  Antoine Girard,et al.  Approximate Simulation Relations for Hybrid Systems , 2008, Discret. Event Dyn. Syst..

[6]  Richard M. Murray,et al.  Consensus Protocols for Undirected Networks of Dynamic Agents with Communication Time-Delays , 2003 .

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

[8]  Antoine Girard,et al.  Approximate simulation Relations for Hybrid Systems , 2006, ADHS.

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

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

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

[12]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[13]  George J. Pappas,et al.  Flocking in Fixed and Switching Networks , 2007, IEEE Transactions on Automatic Control.

[14]  Manfredi Maggiore,et al.  Necessary and sufficient graphical conditions for formation control of unicycles , 2005, IEEE Transactions on Automatic Control.

[15]  F. Bullo,et al.  Motion Coordination with Distributed Information , 2007 .

[16]  Magnus Egerstedt,et al.  Distributed Coordination Control of Multiagent Systems While Preserving Connectedness , 2007, IEEE Transactions on Robotics.

[17]  George J. Pappas,et al.  Approximate Bisimulations for Nonlinear Dynamical Systems , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[18]  George J. Pappas,et al.  Unifying bisimulation relations for discrete and continuous systems , 2002 .

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

[20]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

[21]  Mehran Mesbahi,et al.  On state-dependent dynamic graphs and their controllability properties , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).