Consensus of second‐order discrete‐time multi‐agent systems with relative‐state‐dependent noises

This paper studies the consensus problem of second‐order discrete‐time multi‐agent systems with relative‐state‐dependent noises. Directed switching topologies are considered. Firstly, for a kind of switching topology with each digraph containing a spanning tree, we give a weak consensus result on the basis of the mode‐dependent average dwell time method. Then, if all digraphs in a switching topology are strongly connected and the corresponding Laplacian matrices have a common left eigenvector for zero eigenvalue, we prove that the mean square and almost sure consensus can always be guaranteed for an arbitrary switching sequence with some constant distributed control gains, and we also give the statistic properties of the final consensus points. Numerical examples are presented to illustrate the effectiveness of our results. Copyright © 2017 John Wiley & Sons, Ltd.