Asymmetric bipartite consensus for multi-agent systems with strong-privacy-preserving

In multi-agent systems (MASs), not only do agents engage in cooperative relationships, but they also compete with one another. The topic of collaborative group in MASs has garnered significant attention. Due to the possibility of explicit interaction among agents, the complete sharing of known information among nodes presents a risk of privacy leakage. Therefore, this article explores the problem of asymmetric bipartite consensus control for MASs with strong-privacy-preserving. A novel state decomposition privacy-preserving algorithm is proposed to achieve asymmetric bipartite consensus of MASs. This algorithm can ensure that the initial and final states of each agent will not be compromised, via a preservation coefficient designed in proposed algorithm. By employing algebraic graph theory and automatic control theory, a thorough analysis of the algorithmic performance is conducted. It is demonstrated that our algorithm can preserve the privacy of all agents in MASs while achieving asymmetric bipartite consensus, i.e. the consensus values are different in sign and modulus. Finally, the effectiveness of the main results is validated through simulation examples. This article explores the problem of asymmetric bipartite consensus control for multi-agent systems with strong-privacy-preserving. A novel state decomposition privacy-preserving algorithm is proposed to achieve asymmetric bipartite consensus of multi-agent systems. This algorithm can ensure that the initial and final states of each agent will not be compromised, via a preservation coefficient designed in proposed algorithm. image