Critical sampling rate for sampled-data consensus over random networks

In this paper, we consider the consensus problem for a network of nodes with random interactions and sampled-data control actions. Each node independently samples its neighbors in a random manner over a directed graph underlying the information exchange of different nodes. The relationship between the sampling rate and the achievement of consensus is studied. We first establish a sufficient condition, in terms of the inter-sampling interval, such that consensus in expectation, in mean square, and in almost sure sense are simultaneously achieved provided a mild connectivity assumption for the underlying graph. Necessary and sufficient conditions for mean-square consensus are derived in terms of the spectral radius of the corresponding state transition matrix. These conditions are then interpreted as the existence of a critical value on the inter-sampling interval, below which global mean-square consensus is achieved and above which the system diverges in mean-square sense for some initial states. Finally, we establish an upper bound of the inter-sampling interval, below which almost sure consensus is reached, and a lower bound, above which almost sure divergence is reached. An numerical example is given to validate the theoretical results.

[1]  W. Ren,et al.  Multi‐vehicle coordination for double‐integrator dynamics under fixed undirected/directed interaction in a sampled‐data setting , 2010 .

[2]  Daniel W. C. Ho,et al.  On the Equivalence and Condition of Different Consensus Over a Random Network Generated by i.i.d. Stochastic Matrices , 2011, IEEE Transactions on Automatic Control.

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

[4]  Alba Pagès-Zamora,et al.  Mean Square Convergence of Consensus Algorithms in Random WSNs , 2010, IEEE Transactions on Signal Processing.

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

[6]  Maurizio Porfiri,et al.  Consensus Seeking Over Random Weighted Directed Graphs , 2007, IEEE Transactions on Automatic Control.

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

[8]  Asuman E. Ozdaglar,et al.  Opinion Fluctuations and Disagreement in Social Networks , 2010, Math. Oper. Res..

[9]  Karl Henrik Johansson,et al.  How Agreement and Disagreement Evolve over Random Dynamic Networks , 2012, IEEE Journal on Selected Areas in Communications.

[10]  Yu-Ping Tian,et al.  Consensus of Data-Sampled Multi-Agent Systems With Random Communication Delay and Packet Loss , 2010, IEEE Transactions on Automatic Control.

[11]  Long Wang,et al.  Sampled-Data Based Consensus of Continuous-Time Multi-Agent Systems With Time-Varying Topology , 2011, IEEE Transactions on Automatic Control.

[12]  Tongwen Chen,et al.  Sampled-Data Consensus for Multiple Double Integrators With Arbitrary Sampling , 2012, IEEE Transactions on Automatic Control.

[13]  Ziyang Meng,et al.  Sampled-Data Consensus Over Random Networks , 2015, IEEE Transactions on Signal Processing.

[14]  Stephen P. Boyd,et al.  Linear Matrix Inequalities in Systems and Control Theory , 1994 .

[15]  R. Durrett Probability: Theory and Examples , 1993 .

[16]  E. Yaz Linear Matrix Inequalities In System And Control Theory , 1998, Proceedings of the IEEE.