Average Consensus in Multiagent Systems with the Problem of Packet Losses When Using the Second-Order Neighbors’ Information

الملخص EN

This paper mainly investigates the average consensus of multiagent systems with the problem of packet losses when both the first-order neighbors’ information and the second-order neighbors’ information are used.

The problem is formulated under the sampled-data framework by discretizing the first-order agent dynamics with a zero-order hold.

The communication graph is undirected and the loss of data across each communication link occurs at certain probability, which is governed by a Bernoulli process.

It is found that the distributed average consensus speeds up by using the second-order neighbors’ information when packets are lost.

Numerical examples are given to demonstrate the effectiveness of the proposed methods.