Gathering Asynchronous Swarm Robots under Nonuniform Limited Visibility
This paper proposes a distributed algorithm for gathering a group of autonomous, homogeneous, oblivious, asynchronous mobile robots having limited visibility (sensing) ranges. To the best of our knowledge, all reported results have assumed that the visibility ranges are uniform for all the robots. In contrast, we consider that the visibility ranges of the robots are not uniform. Moreover, the robots have no knowledge about the visibility ranges of other robots. However, a lower bound on the visibility range of all the robots is known to all the robots.
KeywordsAsynchronous robots Nonuniform limited visibility Gathering
Unable to display preview. Download preview PDF.
- 3.Flocchini, P., Prencipe, G., Santoro, N.: Distributed Computing by Oblivious Mobile Robots. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers (2012)Google Scholar
- 6.Prencipe, G.: Impossibility of gathering by a set of autonomous mobile robots. Theoretical Computer Science 384(2 - 3), 222–231 (2007); In: Pelc, A., Raynal, M. (eds.) SIROCCO 2005. LNCS, vol. 3499, pp. 222–231. Springer, Heidelberg (2005) Google Scholar