Observability and controllability verification in multi-agent systems through decentralized Laplacian spectrum estimation

In this paper we show how the decentralized estimation of the spectrum of a network can be used to infer its controllability and observability properties. The proposed approach is applied to networked multi-agent systems whose local interaction rule is based on Laplacian feedback. We provide a decentralized necessary and sufficient condition for observability and controllability based on the estimated eigenvalues. Furthermore we show an example of application of the proposed method and show that the estimated spectrum can also be envisioned as a tool for decentralized formation identification.

[1]  Willem H. Haemers,et al.  Enumeration of cospectral graphs , 2004, Eur. J. Comb..

[2]  Reza Olfati-Saber,et al.  Flocking for multi-agent dynamic systems: algorithms and theory , 2006, IEEE Transactions on Automatic Control.

[3]  Andrea Gasparri,et al.  Decentralized Laplacian eigenvalues estimation for networked multi-agent systems , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

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

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

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

[7]  Richard M. Murray,et al.  INFORMATION FLOW AND COOPERATIVE CONTROL OF VEHICLE FORMATIONS , 2002 .

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

[9]  W. Haemers,et al.  Which graphs are determined by their spectrum , 2003 .

[10]  B. Mohar.  THE LAPLACIAN SPECTRUM OF GRAPHS y , 1991 .

[11]  Antonio Bicchi,et al.  Controllability decompositions of networked systems through quotient graphs , 2008, 2008 47th IEEE Conference on Decision and Control.

[12]  Katsuhiko Ogata,et al.  Modern Control Engineering , 1970 .

[13]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

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

[15]  Xiaoming Hu,et al.  Formation constrained multi-agent control , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

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

[17]  M. Mesbahi,et al.  Formation flying control of multiple spacecraft via graphs, matrix inequalities, and switching , 1999, Proceedings of the 1999 IEEE International Conference on Control Applications (Cat. No.99CH36328).

[18]  Wei Wang,et al.  A sufficient condition for a family of graphs being determined by their generalized spectra , 2006, Eur. J. Comb..

[19]  Magnus Egerstedt,et al.  Observability and estimation in distributed sensor networks , 2007, 2007 46th IEEE Conference on Decision and Control.

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

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

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

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

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