Second-order consensus of multiagent systems with matrix-weighted network

Consensus of Matrix-Weighted Hybrid Multiagent Systems

As we all know, heterogeneity is a very important feature of multiagent systems (MASs). In this article, we examine the consensus control problems of matrix-weighted hybrid MASs, which contain discrete-time and continuous-time dynamic agents. Under fixed and switched undirected networks, three consensus algorithms are proposed for matrix-weighted hybrid MASs. In the three consensus algorithms, the sampled data control method is utilized in the continuous-time subsystem to analyze the convergence of different dynamic agents in the matrix-weighted interaction mode. For the symmetric matrix-weighted fixed and switched multiagent networks, when the sampling period meets certain conditions, the consensus criteria are established via the matrix theory, Lyapunov stability theory, and analysis theory. Moreover, asymmetric matrix-weighted fixed multiagent networks which can be applied to some scenarios with scaled and rotated updates constraints are considered, and consensus criteria are also obtained when the sampling period meets certain conditions. Finally, a few simulation examples are supplied to validate the correctness of the obtained theoretical results.

Bipartite Consensus for Second-Order Multiagent Systems With Matrix-Weighted Signed Network

The second-order scalar-weighted consensus problem of multiagent systems has been well explored. However, in some practical antagonistic interaction networks, the interdependencies of multidimensional states of the agents must be described by matrix coupling. In order to highlight the influence of matrix coupling in the antagonistic interaction network, we investigate the second-order matrix-weighted bipartite consensus problem on undirected structurally balanced signed networks. Under the proposed bipartite consensus protocol, an algebraic condition is obtained for achieving second-order bipartite consensus via utilizing matrix-valued Gauge transformation and stability theory. Then, using the obtained criteria, a more direct algebraic graph condition is given for reaching bipartite consensus. Besides, because of the existence of negative (positive) semidefinite connections, the matrix-weighted network may have clustering phenomena, which means that matrix weights play a critical role in achieving consensus. An algebraic graph condition for admitting cluster bipartite consensus is provided. By designing matrix weights in practical scenarios, the required number of clusters can be obtained. Finally, the theoretical results are verified by five simulation examples.