| Summary: | This article is concerned with the bipartite flocking problem in multi-agent systems. Our contributions can be summarized as follows. Firstly, a class of preassigned-time consensus protocols is proposed to solve the issue of multi-agent systems. Secondly, with the aid of the symmetric properties of the graph theory and the Lyapunov stability theorem, we prove that agents can be divided into two disjointed clusters in a finite time, and they move to opposite directions at the same magnitude and speed. The protocol is novel among existing fixed/finite-time protocols in that the associated settling time is a preassigned constant and a parameter of the protocol. Moreover, it is proven that the diameters of the clusters are bounded and independent of other the protocol parameters. These results are demonstrated through both theoretical analysis and simulation examples.
|
|---|