Reach almost sure consensus with only group information

This brief presents a new distributed scheme to solve the consensus problem for a group of agents if neither their absolute states nor inter-agent relative states are available. The new scheme considers a random partition of agents into two subgroups at each step and then uses the relative group representative state as feedback information for the consensus purpose. It is then shown that almost sure consensus can be achieved under the proposed scheme in both discrete time and continuous time. For the discrete time case, almost sure consensus is achieved if and only if the weighting parameter for state update is greater than one. For the continuous time case, almost sure consensus is realized when the weighting parameter is positive. Moreover, it is shown that if a uniform probability is considered for group selection, then the group of agents can reach average consensus in mean.

[1]  R. Srikant,et al.  Quantized Consensus , 2006, 2006 IEEE International Symposium on Information Theory.

[2]  Yu-Ping Tian,et al.  Maximum Allowable Loss Probability for Consensus of Multi-Agent Systems Over Random Weighted Lossy Networks , 2012, IEEE Transactions on Automatic Control.

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

[4]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

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

[6]  Kai Cai,et al.  Quantized Consensus and Averaging on Gossip Digraphs , 2011, IEEE Transactions on Automatic Control.

[7]  Jonathan H. Manton,et al.  Stochastic Consensus Seeking With Noisy and Directed Inter-Agent Communication: Fixed and Randomly Varying Topologies , 2010, IEEE Transactions on Automatic Control.

[8]  Mireille E. Broucke,et al.  Local control strategies for groups of mobile autonomous agents , 2004, IEEE Transactions on Automatic Control.

[9]  Wenyuan Xu,et al.  Distributed transmit beamforming via feedback-based inter-cluster synchronization , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[10]  Yu-Ping Tian,et al.  Consensus of Multi-Agent Systems With Diverse Input and Communication Delays , 2008, IEEE Transactions on Automatic Control.

[11]  Lin Huang,et al.  Consensus of Multiagent Systems and Synchronization of Complex Networks: A Unified Viewpoint , 2016, IEEE Transactions on Circuits and Systems I: Regular Papers.

[12]  Er-Wei Bai,et al.  A Web Aggregation Approach for Distributed Randomized PageRank Algorithms , 2012, IEEE Transactions on Automatic Control.

[13]  Manfredi Maggiore,et al.  State Agreement for Continuous-Time Coupled Nonlinear Systems , 2007, SIAM J. Control. Optim..

[14]  Alireza Tahbaz-Salehi,et al.  Consensus Over Ergodic Stationary Graph Processes , 2010, IEEE Transactions on Automatic Control.

[15]  Lihua Xie,et al.  Network Topology and Communication Data Rate for Consensusability of Discrete-Time Multi-Agent Systems , 2011, IEEE Transactions on Automatic Control.

[16]  Sandro Zampieri,et al.  Randomized consensus algorithms over large scale networks , 2007 .

[17]  R. Ash,et al.  Probability and measure theory , 1999 .

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

[19]  Ji-Feng Zhang,et al.  Necessary and Sufficient Conditions for Consensusability of Linear Multi-Agent Systems , 2010, IEEE Transactions on Automatic Control.