Consensus of High-Order Nonlinear Multiagent Systems with Constrained Switching Topologies

The relationship between control and communication constraints is becoming of central importance in the consensus problem of networked agents. In this paper, we investigate such a problem for nonlinear multiagent systems with Lipschitz dynamics. To reflect communication constraints, the topology is assumed to switch within a finite set of digraphs characterised by an average dwell time switching signal. By constructing a suitable multiple Lyapunov function, we show that consensus can be reached under the designed consensus protocol. A multistep algorithm for designing consensus protocol is then developed by solving the Lyapunov equation and algebraic Riccati equation. Finally, simulation examples are delineated to substantiate the effectiveness of the proposed algorithms.