Abstract
Robot Systems. This paper considers distributed systems of autonomous robots that can move freely on the two-dimensional Euclidean space, have visibility sensors (to see other robots, obstacles etc.) and can perform computations. One of the fundamental problems in distributed coordination of robots is to gather the robots at a single location. The gathering problem has been studied under various models with the objective of determining the minimal set of assumptions that still allows the robots to gather successfully within a finite time. For example, it is known that gathering can be solved even if the robots are anonymous (indistinguishable from each-other), oblivious (no persistent memory of the past), and cannot communicate explicitly with each other (except for indirect signaling using movement). Further, the robots may not share a common sense of direction. Robots operate in cycles that comprise look, compute, and move phases. The look phase consists in taking a snapshot of the other robots positions. In the compute phase, a robot computes a target destination, based on the previous observation, using a deterministic algorithm and in the move phase, the robot moves toward the computed destination (although the move may end before reaching the target destination). We consider the semi-synchronous ATOM model [4], where each cycle is considered to be atomic but only a subset of the robots may be active in each cycle. The robots are modeled as points on the Euclidean plane and the objective is to gather all robots at a single point.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Agmon, N., Peleg, D.: Fault-tolerant gathering algorithms for autonomous mobile robots. SIAM Journal of Computing 36(1) (2006)
Bouzid, Z., Das, S., Tixeuil, S.: Wait-Free Gathering of Mobile Robots. ArXiv e-prints:1207.0226 (2012)
Dieudonné, Y., Petit, F.: Self-stabilizing Deterministic Gathering. In: Dolev, S. (ed.) ALGOSENSORS 2009. LNCS, vol. 5804, pp. 230–241. Springer, Heidelberg (2009)
Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: Formation of geometric patterns. SIAM Journal of Computing 28(4), 1347–1363 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bouzid, Z., Das, S., Tixeuil, S. (2012). Brief Announcement: Wait-Free Gathering of Mobile Robots. In: Aguilera, M.K. (eds) Distributed Computing. DISC 2012. Lecture Notes in Computer Science, vol 7611. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33651-5_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-33651-5_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33650-8
Online ISBN: 978-3-642-33651-5
eBook Packages: Computer ScienceComputer Science (R0)