Coordination without communication: the case of the flocking problem
From MaRDI portal
Publication:1765241
DOI10.1016/j.dam.2003.11.010zbMath1161.90336OpenAlexW2072958202MaRDI QIDQ1765241
Vincenzo Gervasi, Giuseppe Prencipe
Publication date: 23 February 2005
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2003.11.010
Related Items
Deterministic geoleader election in disoriented anonymous systems, Autonomous mobile robots with lights, Team assembling problem for asynchronous heterogeneous mobile robots, Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity, The kissing problem: how to end a gathering when everyone kisses everyone else goodbye, Adaptive Flocking Control with a Minority of Informed Agents, Oracle-based flocking of mobile robots in crash-recovery model, Monotonic self-stabilization and its application to robust and adaptive pattern formation, On the computational power of energy-constrained mobile robots: algorithms and cross-model analysis, Forming sequences of geometric patterns with oblivious mobile robots
Cites Work