| Summary: | Since group consensus (<i>GC</i>) control accounts for one-half of the multi-robot coordination domain, as does complete consensus control, this paper will formulate a certain kind of <i>GC</i> and group bipartite consensus (<i>GBC</i>) in finite time for multi-agent systems (<i>MAS</i>). It should be noted that the key to this work is that information transfer under acyclic partition networks is zero-sum between groups and the cooperative–competitive interaction. The general <i>GC</i> will firstly be achieved under acyclic partition, which reflects the fact that such topology allows the <i>MAS</i> to reach agreement in an ordered and hierarchical process. Further, the information communication is zero-sum within each group under the acyclic partition signed digraph. Thus, the group–bipartite agreement for <i>MAS</i> is given under acyclic bipartite topology. These results display not only an ordered, hierarchical state, but also an intra-group symmetric state. In addition, simulation examples are presented in parallel with the theoretical results.
|
|---|