Search

In this article, the issue of flocking control for Cucker–Smale model under denial‐of‐service (DoS) attacks is discussed. It is assumed that there is an active stage and an asleep stage for each period of the DoS. Malicious attacks partially or completely destroy the network communication links in the active stages, and replenish energy without any attacks in the dormant stages. By constructing the agents' position and velocity errors, the C–S model under DoS attacks is equivalently transformed into error systems. By applying the approach of products convergence for infinite sub‐stochastic matrices, a sufficient condition for producing the flocking behavior is obtained. An upper bound of relative errors for agents' final positions is established, which depends on initial states, the topology structure and the weight function. Finally, simulation experiments verify the effectiveness of the theoretical results. [ABSTRACT FROM AUTHOR]

In this paper, a Cucker–Smale model with time-varying heterogeneous delays in the communication process is investigated, where the delay on each communication link is time-varying and independent of other communication links. A general update rule based on the distance between agents is used to determine the edge weights of the communication network. The method of constructing augmented system is used so that the system stability is transformed into a product convergence problem of time-varying sub-stochastic matrices equivalently. By analyzing this convergence problem, a sufficient condition is established to achieve flocking, which relates to the initial states, the structure of communication network and the upper bound of time delays. [ABSTRACT FROM AUTHOR]

This paper explores the collective behavior of bipartite flocking for a set of autonomous mobile agents based on Cucker-Smale update rules on directed cooperation-competition networks. In our model, cooperative or competitive degree between neighbouring agents is set by a nonlinear function of the communication distance between agents, which is called weight function, and further the influence of communication delays on the system stability and the final distance between agents is analyzed. With the help of related conclusions about sub-stochastic matrices, a sufficient condition relying on the topology structure, weight functions and initial states is established to guarantee the realization of bipartite flocking behavior. In the end the effectiveness of dynamic results is verified through a numerical example. [ABSTRACT FROM AUTHOR]

In this contribution, we aim to examine the scaled consensus problem for heterogeneous multi-agent systems, which comprise two kinds of agents: the agents with first-order dynamics and the agents with second-order dynamics. The scaled consensus here means that the ratios between the states of the agents asymptotically approach specified constants instead of the same value. Firstly, appropriate distributed control protocols are designed for first-order and second-order networked agents, respectively. Particularly, the effects of switching communication networks and time-varying delays on model performance are investigated in this paper. Secondly, an augmented system approach based on algebraic graph theory and non-negative matrix theory is adopted to solve the proposed scaled consensus problem. Finally, a sufficient criterion is established to certify the scaled consensus performance of mixed agents. The correctness of the theoretical result is demonstrated through several simulation examples. [ABSTRACT FROM AUTHOR]