Search

This paper is concerned with the secure bipartite consensus of second-order multi-agent systems under denial-of-service (DoS) attacks. The communication network is an antagonistic network, in which there is cooperative or competitive relationship between neighboring agents. Meanwhile, information cannot be transmitted when the system is attacked. A novel event-triggered control algorithm based on sampled data is proposed to save limited resources and exclude the Zeno behavior. By applying the convergence of monotone sequences, graph theory as well as the discrete-time Lyapunov function method, some sufficient conditions on threshold parameters, frequency and duration of DoS attacks, and sampling period are derived to ensure the bipartite consensus under DoS attacks. Finally, the correctness and advantages of theoretical results are demonstrated by a numerical simulation. [ABSTRACT FROM AUTHOR]

Abstract: Repeated practice is one of the most effective methods in improving the performance of coordination control tasks for groups of individuals, such as marching band, soldier (tank or warcraft) formation, and unmanned aerial vehicle flying queue. The key objective of this paper is to give a theoretical explanation for this observed behavior by considering a class of coordination learning problems for groups of mobile agents. To be specific, the agents are considered to preserve the desired relative formations between each other through a learning process, for which iterative rules are applied to construct distributed algorithms based on the relative information between each agent and its neighbors. Convergence results are derived by combining the graph theory based method and the Lyapunov analysis, which can address coordination learning problems for multi-agent systems both with and without a reference as the prior knowledge. In addition, numerical simulation results are provided to demonstrate the coordination learning performance for groups of mobile agents. [Copyright &y& Elsevier]