Pulling the Strings on Agreement: Anchoring, Controllability, and Graph Automorphisms

This work examines the controlled Laplacian (or agreement) over a network of interconnected dynamic units. This dynamics has recently been the focus of a large number of research work in the systems community. Most of the existing work in this area- however- consider the unforced agreement protocol. In the present paper, we consider the controlled version of this dynamics and introduce graph theoretic conditions for its system theoretic properties. In particular, we show how the symmetry structure of the network, characterized in terms of its automorphism group, relates to the network controllability. Some of the ramifications of such a characterization are then explored.

[1]  Stephen P. Boyd,et al.  Fast linear iterations for distributed averaging , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[2]  R. Merris.  Laplacian matrices of graphs: a survey , 1994 .

[3]  M. Mesbahi.  On State-dependent dynamic graphs and their controllability properties , 2005, IEEE Transactions on Automatic Control.

[4]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

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

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

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

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

[9]  R. Olfati-Saber,et al.  Consensus Filters for Sensor Networks and Distributed Sensor Fusion , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

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

[11]  Thomas Kailath,et al.  Linear Systems , 1980 .

[12]  Norman Biggs.  Algebraic Graph Theory: Index , 1974 .

[13]  Mehran Mesbahi,et al.  Agreement over random networks , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[14]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[15]  Luc Moreau,et al.  Stability of multiagent systems with time-dependent communication links , 2005, IEEE Transactions on Automatic Control.

[16]  J. Lauri,et al.  Topics in Graph Automorphisms and Reconstruction , 2003 .

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

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