Cucker–Smale flocking subject to random failure on general digraphs

This paper studies the Cucker–Smale (C–S) flocking subject to random failure under general interaction topologies, which contain the hierarchical leadership and rooted leadership as special cases. Furthermore, at each time step, each of the agents can fail to interact with any of its neighbors. The...

Full description

Saved in:
Bibliographic Details
Published inAutomatica (Oxford) Vol. 106; pp. 54 - 60
Main Authors He, Yuehua, Mu, Xiaowu
Format Journal Article
LanguageEnglish
Published Elsevier Ltd 01.08.2019
Subjects
Cucker–Smale flocking
Failures
General digraphs
General digraphs
Failures
Cucker–Smale flocking
Online AccessGet full text

Cover

More Information
Summary:This paper studies the Cucker–Smale (C–S) flocking subject to random failure under general interaction topologies, which contain the hierarchical leadership and rooted leadership as special cases. Furthermore, at each time step, each of the agents can fail to interact with any of its neighbors. The random failures are assumed to be not independent. We prove that the flocking would occur almost surely under some conditions on the initial state of the flock only. The result suggests that the C–S flocking system on general digraphs can endure random failure in interactions. Finally, several numerical simulations are provided to illustrate the obtained results.
ISSN:0005-1098
1873-2836
DOI:10.1016/j.automatica.2019.04.031