Distributed Consensus of Linear Multi-Agent Systems With Nonidentical Random Packet Loss

Abstract

In this paper, we consider the leader-following consensus problem of a class of linear multi-agent systems (MASs) with nonidentical random packet loss. The network topology among all agents is described as a directed graph and the packet loss across each communication channel in the network is modeled by the Bernoulli process. A distributed protocol is proposed such that the L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> -consensus of the MASs can be achieved. Moreover, the packet loss of the communication channels is allowed to be nonidentical, and the network topology is only required to be a directed graph containing a spanning tree. Finally, a simulation example is used to illustrate the derived results.