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

Simple item page
dc.creatorLi, Sanjiang
dc.creatorWang, Huaiqing
dc.date2004-07-09
dc.date2004-07-14
dc.date.accessioned2026-07-07T03:21:32Z
dc.date.available2026-07-07T03:21:32Z
dc.descriptionRecently, 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.
dc.description11 pages, linguistic mistakes corrected, title modified
dc.identifierhttps://arxiv.org/abs/cs/0407021
dc.identifierhttp://arxiv.org/abs/cs/0407021
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32236
dc.subjectMultiagent Systems
dc.subjectArtificial Intelligence
dc.titleMulti-agent coordination using nearest neighbor rules: revisiting the Vicsek model
dc.typetext

Files

Collections

arXiv