Consensus control of multi-agent systems with P-one-sided Lipschitz

This paper investigates the consensus problem for a class of multi-agent systems with P-one-sided Lipschitz nonlinearity. This nonlinearity offers a significant extension to application range of existing consensus control protocol design methods, which removes the assumption of the quadratic inner-boundedness. To solve this problem, a strongly connected graph topology is applied within the consensus protocol design framework. Moreover, the leader-following scenario is addressed under the graph topology. Under the above objectives, sufficient conditions are employed to yield consensus. Two examples are performed to illustrate the properties.