Finite-time asymmetric bipartite consensus for multi-agent systems with privacy-preserving

This article addresses the finite-time asymmetric bipartite consensus problem for multi-agent systems (MASs) with privacy-preserving. Firstly, a novel algorithm for MASs called the sub-state sharing privacy-preserving algorithm (SSPPA) is proposed, which prevents the leakage of privacy information by hiding the initial state of agents within the system. SSPPA decomposes the initial state of each agent in the system, and then transmits the decomposed sub-states. After receiving the sub-state information from neighboring nodes, the destination node recombines them to generate a new hidden value. Secondly, a nonlinear control protocol with asymmetric influence coefficient is constructed, which can reach finite- and fixed-time asymmetric bipartite consensus. Then, through the analysis of the performance of the proposed algorithm, it is found that the algorithm will not affect the ultimate convergence of the system. Finally, simulation experiments are conducted to verify the effectiveness of both the privacy-preserving algorithm and control protocol.