Robustness of Cucker-Smale flocking model
Eduardo Canale, Federico Dalmao, Ernesto Mordecki, Max Souza

TL;DR
This paper investigates the robustness of the Cucker-Smale flocking model when agents can randomly fail to connect, demonstrating that flocking behavior persists under certain probabilistic failure conditions.
Contribution
It extends the deterministic Cucker-Smale model by incorporating random connection failures and proves flocking behavior remains robust under these stochastic conditions.
Findings
Flocking behavior persists despite random connection failures.
Robustness holds for failure rates with linear or sub-linear decay.
The model's core properties are maintained under probabilistic failures.
Abstract
Consider a system of autonomous interacting agents moving in space, adjusting each own velocity as a weighted mean of the relative velocities of the other agents. In order to test the robustness of the model, we assume that each pair of agents, at each time step, can fail to connect with certain probability, the failure rate. This is a modification of the (deterministic) Flocking model introduced by Cucker and Smale in Emergent behavior in flocks, IEEE Trans. on Autom. Control, 2007, 52 (May) pp. 852-862. We prove that, if this random failures are independent in time and space, and have linear or sub-linear distance dependent rate of decay, the characteristic behavior of flocking exhibited by the original deterministic model, also holds true under random failures, for all failure rates.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed Control Multi-Agent Systems · Advanced Queuing Theory Analysis · Game Theory and Applications
