Paper Info
Title
A local O(n2) gathering algorithm
Abstract
The gathering problem, where $n$ autonomous robots with restricted capabilities are required to meet in a single point of the plane, is widely studied. We consider the case that robots are limited to see only robots within a bounded vicinity and present an algorithm achieving gathering in O(n2) rounds in expectation. A round consists of a movement of all robots, in random order. All previous algorithms with a proven time bound assume global view on the configuration of all robots.
Year
DOI
Venue
2010
10.1145/1810479.1810523
SPAA
Keywords
DocType
Citations 
bounded vicinity,restricted capability,autonomous robot,single point,proven time,gathering problem,random order,previous algorithm,global view,local O
Conference
14
PageRank 
References 
Authors
0.77
12
3
Name
Order
Citations
PageRank
Bastian Degener113010.55
Barbara Kempkes21279.43
Friedhelm Meyer auf der Heide31744238.01