Bipartite flock control of multi-agent systems

This paper addresses the bipartite flock control problem with or without a virtual leader. Using structurally balanced signed graph theory and LaSalle's invariance principle, we prove that the algorithm guarantees a bipartite flocking behavior. In such a collective motion, the whole group separates into two clusters, in each of which all individuals move with the same direction. Meanwhile, every pair of agents in different clusters moves with opposite directions. Moreover, all agents in the two separated clusters approach a common velocity magnitude, and collision avoidance among each cluster is ensured as well. Finally, the proposed bipartite flock control method are examined by numerical simulations. The bipartite flocking motion addressed by this paper has its references in both natural collective motions and human group behaviors such as predator-prey and panic escaping scenarios.