Consensus-Related Performance of Triplex MASs Based on Partial Complete Graph Structure

Abstract

This article mainly studies first-order coherence related to the robustness of the triplex MASs consensus models with partial complete graph structures; the performance index is studied through algebraic graph theory. The topologies of the novel triplex networks are generated by graph operations and the approach of graph spectra is applied to calculate the first-order network coherence. The coherence asymptotic behaviours of the three cases of the partial complete structures are analysed and compared. We find that under the condition that the number of nodes in partial complete substructures n tends to infinity, the coherence asymptotic behaviour of the two sorts of non-isomorphic three-layered networks will be increased by r−12(r+1), which is irrelevant to the peripheral vertices number p; when p tends to infinity, adding star copies to the original triplex topologies will reverse the original size relationship of the coherence under consideration of the triplex networks. Finally, the coherence of the three-layered networks with the same sorts of parameters, but non-isomorphic graphs, are simulated to verify the results.

Keywords

• multi-agent system
• consensus
• coherence
• Cartesian product
• Laplacian spectrum