On the power of bounded asynchrony: convergence by autonomous robots with limited visibility

A distributed algorithm A solves the Point Convergence task if an arbitrarily large collection of entities, starting in an arbitrary configuration, move under the control of A to eventually form and thereafter maintain configurations in which the separation between all entities is arbitrarily small....

Ausführliche Beschreibung