Consensus With Output Saturations

Abstract

This paper considers a standard consensus algorithm under output saturations. In this case, the global consensus cannot be realized due to the existence of stable equilibrium points that do not belong to the consensus manifold. Therefore, this paper investigates necessary and sufficient initial conditions for the achievement of consensus that characterize an exact domain of attraction. Specifically, this paper considers single-integrator agents with both fixed and time-varying undirected graphs. Then, we show that the consensus will be achieved if and only if the average of the initial states is within the minimum saturation level.