Identifiability of links and nodes in multi-agent systems under the agreement protocol

In this paper, the question of identifying various links and nodes in the network based on the observed agent dynamics is addressed. The focus is on a multi-agent network that evolves under the linear agreement protocol. The results help determine if various components of the network are distinguishable from each other, based on the choice of initial conditions and the observed output responses. Identifiability of links and nodes are studied separately, and in each case, the role of symmetries in the network information flow graph are analyzed. Examples are provided to elucidate the results.

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

[2]  Stephen P. Boyd,et al.  Distributed average consensus with least-mean-square deviation , 2007, J. Parallel Distributed Comput..

[3]  John N. Tsitsiklis,et al.  Convergence Speed in Distributed Consensus and Averaging , 2009, SIAM J. Control. Optim..

[4]  Amir G. Aghdam,et al.  Leader localization in multi-agent systems subject to failure: A graph-theoretic approach , 2011, Autom..

[5]  Randal W. Beard,et al.  Consensus seeking in multiagent systems under dynamically changing interaction topologies , 2005, IEEE Transactions on Automatic Control.

[6]  Jorge Cortes,et al.  Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms , 2009 .

[7]  Randal W. Beard,et al.  Distributed Consensus in Multi-vehicle Cooperative Control - Theory and Applications , 2007, Communications and Control Engineering.

[8]  Alireza Tahbaz-Salehi,et al.  A Necessary and Sufficient Condition for Consensus Over Random Networks , 2008, IEEE Transactions on Automatic Control.

[9]  Amir G. Aghdam,et al.  Structural controllability of multi-agent systems subject to simultaneous failure of links and agents , 2011, IEEE Conference on Decision and Control and European Control Conference.

[10]  Junming Xu.  Topological Structure and Analysis of Interconnection Networks , 2002, Network Theory and Applications.

[11]  Nathan Michael,et al.  Vision-Based, Distributed Control Laws for Motion Coordination of Nonholonomic Robots , 2009, IEEE Transactions on Robotics.

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

[13]  Amir G. Aghdam,et al.  A Class of Bounded Distributed Control Strategies for Connectivity Preservation in Multi-Agent Systems , 2010, IEEE Transactions on Automatic Control.

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

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

[16]  Magnus Egerstedt,et al.  Laplacian Sheep: A Hybrid, Stop-Go Policy for Leader-Based Containment Control , 2006, HSCC.

[17]  Vicsek,et al.  Novel type of phase transition in a system of self-driven particles. , 1995, Physical review letters.

[18]  Amir G. Aghdam,et al.  Detectability of multiple link failures in multi-agent systems under the agreement protocol , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[19]  Amir G. Aghdam,et al.  Characterization of link failures in multi-agent systems under the agreement protocol , 2012, 2012 American Control Conference (ACC).