Couple-Group Consensus for First Order Discrete-Time Multiagent Systems With Competition-Cooperation and Input Saturation Constraints

Collaborative consensus control of multiagent systems has become an important research topic in the field of artificial intelligence in recent years. This paper deals with the couple-group consensus for the first order discrete-time systems with input saturation constraints. Compared to most previous studies, this article focuses on the control input constraints phenomenon in couple-group consensus problem. Based on the relationship between competition and cooperation, a new negotiation protocol is designed to achieve couple-group consensus. Furthermore, combining graph theory with Lyapunov theorem, the control gain condition is obtained. Finally, the results of numeric modeling show that the method is correctness and effectiveness.