On the Feasibility of Gathering by Autonomous Mobile Robots
Given a set of n autonomous mobile robots that can freely move on a two dimensional plane, they are required to gather in a position of the plane not fixed in advance (Gathering Problem). The main research question we address in this paper is: under which conditions this task can be accomplished by the robots? The studied robots are quite simple: they are anonymous, totally asynchronous, they do not have any memory of past computations, they cannot explicitly communicate among each other. We show that this simple task cannot be in general accomplished by the considered system of robots.
KeywordsMobile Robots Multiplicity Detection Distributed Coordination Distributed Models Computability
Unable to display preview. Download preview PDF.
- 1.Agmon, N., Peleg, D.: Fault Tolerant Gathering Algorithms for Autonomous Mobile Robots. In: Proc. 15th Symposium on Discrete Algorithms (SODA 2004), pp. 1063–1071 (2004)Google Scholar
- 5.Cieliebak, M., Prencipe, G.: Gathering Autonomous Mobile Robots. In: Proc. of 9th International Colloquium on Structural Information And Communication Complexity (SIROCCO 9), June 2002, pp. 57–72 (2002)Google Scholar
- 6.Cohen, R., Peleg, D.: Robot Convergence via Center-of-gravity Algorithms. In: Proc. 11th International Colloquium On Structural Information And Communication Complexity (SIROCCO 11), pp. 79–88 (2004)Google Scholar
- 9.Prencipe, G.: The Effect of Synchronicity on the Behavior of Autonomous Mobile Robots. In: Theory of Computing Systems (2004) (accepted for publication)Google Scholar