Abstract
In this paper, the leader-follower Cucker–Smale flocking system with bounded missing data and random communication radius is studied. The communication network is determined by the stochastic distance radii between agents. The process by which data are lost in the communication network is independent and identically distributed. The goal of this paper is to determine a lower bound on the probability that the agents asymptotically achieve a flocking behaviour, i.e. the relative velocities between the leader agent and other agents asymptotically vanish and the relative positions converge. Finally, a numerical simulation example is provided to illustrate the obtained results.
Get full access to this article
View all access options for this article.
