2014/05/01 by Eduardo Canale, Federico Dalmao, Canale, Eduardo +5
Business, Management and Accounting · Computer Science · Decision Sciences · #Advanced Queuing Theory Analysis #Distributed Control Multi-Agent Systems #FOS: Mathematics #Game Theory and Applications #Probability (math.PR)
paper · pdf · doi:10.48550/arxiv.1405.0317
openalex publication_date 2014/05/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.