Voltage Graphs and Cluster Consensus with Point Group Symmetries

Abstract

A cluster consensus system is a multi-agent system in which the autonomous agents communicate to form multiple clusters, with each cluster of agents asymptotically converging to the same clustering point. We introduce in this paper a special class of cluster consensus dynamics, termed the $G$-clustering dynamics for $G$ a point group, whereby the autonomous agents can form as many as $|G|$ clusters, and moreover, the associated $|G|$ clustering points exhibit a geometric symmetry induced by the point group. The definition of a $G$-clustering dynamics relies on the use of the so-called voltage graph. We recall that a $G$-voltage graph is comprised of two elements---one is a directed graph (digraph), and the other is a map assigning elements of a group~$G$ to the edges of the digraph. For example, in the case when $G = \{1, -1\}$, i.e., a cyclic group of order~$2$, a voltage graph is nothing but a signed graph. A $G$-clustering dynamics can then be viewed as a generalization of the so-called Altafini's model, which was originally defined over a signed graph, by defining the dynamics over a voltage graph. One of the main contributions of this paper is to identify a necessary and sufficient condition for the exponential convergence of a $G$-clustering dynamics. Various properties of voltage graphs that are necessary for establishing the convergence result are also investigated, some of which might be of independent interest in topological graph theory.