Multi-agent coordination using nearest neighbor rules: revisiting the Vicsek model

Abstract

Recently, Jadbabaie, Lin, and Morse (IEEE TAC, 48(6)2003:988-1001) offered a mathematical analysis of the discrete time model of groups of mobile autonomous agents raised by Vicsek et al. in 1995. In their paper, Jadbabaie et al. showed that all agents shall move in the same heading, provided that these agents are periodically linked together. This paper sharpens this result by showing that coordination will be reached under a very weak condition that requires all agents are finally linked together. This condition is also strictly weaker than the one Jadbabaie et al. desired.

11 pages, linguistic mistakes corrected, title modified

References in corpus (2)

• Novel type of phase transition in a system of self-driven particles
• Flocks, herds, and schools: A quantitative theory of flocking

Cited by in corpus (8)

• Efficient Information Aggregation Strategies for Distributed Control and Signal Processing
• The Convergence of Bird Flocking
• Convergence of type-symmetric and cut-balanced consensus seeking systems (extended version)
• Convergence Speed in Distributed Consensus and Control
• On the Nonexistence of Quadratic Lyapunov Functions for Consensus Algorithms
• The Total s-Energy of a Multiagent System
• A lower bound for distributed averaging algorithms
• Eminence Grise Coalitions: On the Shaping of Public Opinion