Autors:

CiteWeb id: 20020000020

CiteWeb score: 9085

DOI: 10.1109/CDC.2002.1184304

Vicsek et al. proposed (1995) a simple but compelling discrete-time model of n autonomous agents {i.e., points or particles} all moving in the plane with the same speed but with different headings. Each agent's heading is updated using a local rule based on the average of its own heading plus the headings of its "neighbors". In their paper, Vicsek et al. provide simulation results which demonstrate that the nearest neighbor rule they are studying can cause all agents to eventually move in the same direction despite the absence of centralized coordination and despite the fact that each agent's set of nearest neighbors change with time as the system evolves. This paper provides a theoretical explanation for this observed behavior. In addition, convergence results are derived for several other similarly inspired models. The Vicsek model proves to be a graphic example of a switched linear system which is stable, but for which there does not exist a common quadratic Lyapunov function.

The publication "Coordination of groups of mobile autonomous agents using nearest neighbor rules" is placed in the Top 1000 of the best publications in CiteWeb. Also in the category Computer Science it is included to the Top 1000. Additionally, the publicaiton "Coordination of groups of mobile autonomous agents using nearest neighbor rules" is placed in the Top 100 among other scientific works published in 2002.
Links to full text of the publication: