Consensus of multiagent systems with random switching topologies and its application

Abstract

SummaryThis paper is concerned on the consensus problem of multiagent systems with random switching topologies, where the dwell time of each topology consists of fixed and random parts. Firstly, the consensus analysis of such multiagent systems is considered by a mode‐dependent Lyapunov function approach, whose conditions are developed in terms of linear matrix inequalities. Then, three kinds of consensus protocols based on random switching topologies are proposed, whose differences are also illustrated. Moreover, all the existence conditions of such consensus controllers are presented with solvable forms, where the dwell times and topology are both included and play important roles. Finally, the proposed consensus protocols are applied to a chemical process to demonstrate the effectiveness of the proposed methods.