ABSTRACT
This article investigates the leader-following synchronization problem of multiagent systems (MASs) under hybrid cyber attacks, which refers to deception attacks and multichannel independent denial-of-service (DoS) attacks in communication channels. In order to achieve the secure control of MASs under hybrid cyber attacks, a novel impulsive control method based on topology switching is proposed, and a new algorithm for determining impulsive instants is designed. In addition, the cooperative-competitive relationship between agents is also considered, which is more in line with reality. Sufficient conditions for ensuring secure control of MASs and a parametric upper bound on the error vector norm between the agents and the leader are obtained. Finally, the numerical simulation verified the effectiveness of the proposed algorithm.
ABSTRACT
In this paper, the problem of prescribed-time containment control for a second-order multiple leader-follower systems (MLFSs) is studied, in where both collision avoidance and connectivity maintenance of the agents are considered. Firstly, an effective exponential potential field function (EAPF) with constraints based on the estimated distance is designed to achieve collision resistance and connectivity preservation of the agents at a prescribed-time. Secondly, an estimator-based distributed control protocol is proposed, which drives the agents to achieve containment control in a cooperative manner at a prescribed-time. Furthermore, a novel distributed control protocol containing a collision avoidance term and a containment control term is addressed as well, which enables all followers to complete collision avoidance and connectivity maintenance in any prescribed-time and enter the leaders' convex packet. Finally, the stability of the system is technically analyzed by using Lyapunov theory, and the effectiveness of the presented strategies is verified by several simulations.
ABSTRACT
This article considers distributed optimization by a group of agents over an undirected network. The objective is to minimize the sum of a twice differentiable convex function and two possibly nonsmooth convex functions, one of which is composed of a bounded linear operator. A novel distributed primal-dual fixed point algorithm is proposed based on an adapted metric method, which exploits the second-order information of the differentiable convex function. Furthermore, by incorporating a randomized coordinate activation mechanism, we propose a randomized asynchronous iterative distributed algorithm that allows each agent to randomly and independently decide whether to perform an update or remain unchanged at each iteration, and thus alleviates the communication cost. Moreover, the proposed algorithms adopt nonidentical stepsizes to endow each agent with more independence. Numerical simulation results substantiate the feasibility of the proposed algorithms and the correctness of the theoretical results.
ABSTRACT
This article discusses the couple-group consensus for heterogeneous multiagent systems via event-triggered and pinning control methods. Considering cooperative-competitive interaction among the agents, a novel group consensus protocol is designed. As inducing the time-correlation threshold function, a class of fully distributed event-triggered conditions without depending on any global information is proposed. Utilizing the Lyapunov stability theory, some sufficient conditions are obtained. Under hybrid event triggered and pinning control, pinning control strategies are first introduced. It is shown that under the proposed strategies, all agents can asymptotically achieve pinning couple-group consensus with discontinuous communication in a fully distributed way. Furthermore, the Zeno behavior for each agent is overcome. Finally, the reduction of the systems' controller update frequency and the correctness of our conclusions are illustrated by some simulations.