Multi-agent coordination using nearest neighbor rules: revisiting the Vicsek model
Sanjiang Li, Huaiqing Wang
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.
Create a lesson
Related papers
A Framework for Context Enrichment and Selective Robustness in LLM Social Agents
Mattia Greiche, Reihaneh Rabbany, Maximilian Puelma Touzel
Airlock: Bounding the Multi-Agent Blast Radius via Selective Online Containment
Zhonghao Zhan, Javad Forough, Yefan Zhang et al.
Mechanical Engineering Skills: An Open Library of Agent Skills for Design, Analysis and Manufacturing
Achuth Chandrasekhar, Jesse Barkley, Peter Pak et al.
Same Method, Different Task: What the Bitter Lesson Does Not License in Social Simulation
Justin Downes, Robby Milletich, Newel Hirst
GeoFaham: Domain-Specialized Multi-Agent Geospatial Analytics for Disaster Response
Muhammad Sohail Danish, Gilles Q. Hacheme, Akram Zaytar et al.
Local Visibility Roadmaps in Continous Multi-agent Path Finding
Kristýna Janovská, Pavel Surynek