Max-consensus of multi-agent systems in random networks

Abstract

This paper considers max-consensus of a discrete-time multi-agent system (MAS) in directed random networks. Interactions among agents in the MAS are probabilistic and independent with each other. By using max-plus algebra and random theory, a sufficient and necessary condition is given for achieving max-consensus of the MAS. Moreover, we demonstrate that the max-consensus in four probabilistic senses (almost surely, in probability, expectation and mean square) is equivalent when expected graph is strongly connected. This ensures that max-consensus can be achieved in multi-agent systems even if random failures occur in the communication network, which is of practical importance in the fields of wireless sensor networks and distributed computing. A simulation example is presented to illustrate the effectiveness of theoretical results.