Reaching a Group-Agreement in Finite Time Under Acyclic Interaction Topology

Abstract This paper discusses the finite time agreement problem of networks with acyclic partition topology. In view of the structural characteristics of such network topology, mathematical induction is particularly suitable to prove the main conclusions in the paper. In addition, for the consideration of the finite time consensus problem, in addition to using basic matrix theory to verify the solution of the problem, this brief also has a more detailed analysis of the time required to reach consensus. Based on these two points, it is observed that the solution of this problem is due to the features of acyclic partition interactions and the continuity of the related finite time protocol and contributes to the research on the grouping consensus of multiagent system. Furthermore, simulation examples are presented to verify the theoretical results.