Name
Abstract | ||
|---|---|---|
We consider the Cucker–Smale model consisting of interacted particles involving random failure. More precisely, each pair of neighboring agents can fail to interact with a certain probability. Two cases are considered: undirected connected interactions and directed rooted interactions. Our results show that the unconditional flocking for long-range communication rate is still true independently of the failure rate probability. For short-range communication rate, conditional flocking can be established. These results, together with the previous study of Dalmao and Mordecki (2012) [8], suggest that the C–S flocking system under various interaction topologies can endure random failure in interactions. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.jfranklin.2014.12.007 | Journal of the Franklin Institute |
Field | DocType | Volume |
Topology,Flocking (texture),Mathematical optimization,Failure rate,Network topology,Mathematics,Distributed computing | Journal | 352 |
Issue | ISSN | Citations |
3 | 0016-0032 | 3 |
PageRank | References | Authors |
0.40 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lining Ru | 1 | 3 | 0.40 |
| Zhuchun Li | 2 | 3 | 1.07 |
| Xiaoping Xue | 3 | 186 | 17.00 |