Search

This article investigates the privacy-preserving average consensus problem for the general continuous-time multiagent network systems (MANSs) with time delay via the event-triggered communication scheme. In order to avoid disclosing the initial states of the network agents and at the same time achieve the agents’ consensus for MANSs with time delay, a novel consensus control algorithm based on a new privacy-preserving approach is proposed. The new privacy-preserving approach is that we construct an output mask to make agents’ internal states indiscernible by others, which is different from the existing privacy-preserving methods adding random noises to the update law of agents’ states. Compared with the existing privacy-preserving methods, our approach makes all agents in MANSs exactly converge to the average value of initial states instead of its mean square value. Based on the proposed algorithm, we carry out the detailed theoretical consensus analysis of the network agents, from which, it is shown that the upper bound of the communication time delay between neighbors’ agents can be estimated approximately. Moreover, the Zeno-behavior of event-triggered time sequences for each agent is excluded. Finally, two simulation examples are performed to demonstrate the effectiveness of our theoretical results. [ABSTRACT FROM AUTHOR]

Abstract This paper investigates the distributed optimal consensus problem by designing the multi-agent communication systems, where each agent has local access to its own strongly convex utility function. Here, we design two distributed consensus-based optimization algorithms to tackle the optimization problem of multi-agent systems. One is the second-order optimization consensus algorithm, and another is the third-order algorithm. Moreover, the two algorithms can ensure that all agents achieve consensus at a common state which minimizes the sum of the objective function under the assumption that interaction graph is strongly connected and detailed balanced. For each of the proposed algorithms, it can be found that the equilibrium point of the algorithm is the optimal point and it is proved to be asymptotically stable under given conditions. Finally, the performance of the proposed algorithms are verified by two simulations based on an IEEE 14-bus test system and an IEEE 57-bus test system. [ABSTRACT FROM AUTHOR]