Couple-group consensus of multi-agent systems in the cooperation-competition network
Hong‐Xiang Hu, Wenwu Yu, Guanghui Wen, Guozheng Qin, Quanxin Cheng · 2016
In this paper, a couple-group consensus problem is investigated for the dynamic agents with the inputs in the cooperation-competition network which can be divided into multiple sub-networks. The weights between the agents in the same sub-network are positive, while the weights between the agents among different sub-networks are negative. Then, the reverse couple-group consensus is firstly studied without the in-degree balance condition. By defining the mirror graph and establishing the solution of the multi-agent system, it is found that the reverse couple-group consensus problem can be achieved if the mirror graph is strongly connected. The explicit expression of the error level is also derived, which would be vanished for multi-agent systems with some special kinds of inputs. Finally, simulation results are presented to validate the effectiveness of the theoretical analysis.