Consensus of One-Sided Lipschitz Multiagents Under Switching Topologies

This paper considers the leader-following consensus of multiagents with one-sided Lipschitz nonlinear dynamics by considering switching topologies. For the suitable selection of the consensus control gain matrix and coupling weight, a new condition for consensus is achieved for switching communication links with a directed spanning tree in the topology by constraining the dwell time. Employing a communication restoration mechanism allows a method to be obtained for the case in which a topology violates a permanent directed spanning tree. Computationally straightforward consensus controller design conditions that are necessary and sufficient for the former conditions are also developed for both cases. These simpler conditions can be used to obtain consensus protocol gains directly through convex routines. An algorithm is also provided to solve nonlinear constraints using the cone complementary linearization approach by considering a nonlinear objective function optimization problem. A numerical simulation is provided for multiagents that demonstrates the proposed control schemes' efficiency.