Group Consensus with Switching Topology of Multi-agent Systems

In this paper, we consider group consensus problem with switching topology by giving a kind of new protocol in which communication graph weights are all nonnegative. This is also consistent with classic protocols. The sufficient conditions which group consensus under this kind of protocols can reach for both single and second order multi-agent system are obtained. Finally, numerical examples are given to illustrate our theoretical results.