Global consensus of multiple integrator agents via saturated controls

Abstract

This paper investigates the problem of global leader-following consensus of multiple integrator agents subject to control input saturation. A weighted and saturated consensus algorithm is proposed to solve this problem. Both the case of an undirected communication topology and the case of a directed communication topology are considered. It is shown that global consensus of the multiple integrator agents can be reached under a general undirected graph or a detailed balanced directed graph provided that its generated graph contains a directed spanning tree. Numerical examples are provided to demonstrate the theoretical results.