Quentin Bramas
ABSTRACT
We propose a new probabilistic pattern formation algorithm for oblivious mobile robots that operates in the ASYNC model. Unlike previous work, our algorithm makes no assumptions about the local coordinate systems of robots (the robots do not share a common "North" nor a common "Right"), yet it preserves the ability from any initial configuration that contains at least 5 robots to form any general pattern (and not just patterns that satisfy symmetricity predicates). Our proposal also gets rid of the previous assumption (in the same model) that robots do not pause while moving (so, our robots really are fully asynchronous), and the amount of randomness is kept low -- a single random bit per robot per Look-Compute-Move cycle is used. Our protocol consists in the combination of two phases, a probabilistic leader election phase, and a deterministic pattern formation one. As the deterministic phase does not use chirality, it may be of independent interest in the deterministic context. A noteworthy feature of our algorithm is the ability to form patterns with multiplicity points (except the gathering case due to impossibility results), a new feature in the context of pattern formation that we believe is an important asset of our approach.
- Zohir Bouzid and Anissa Lamani. Robot networks with homonyms: The case of patterns formation. In Xavier Défago, Franck Petit, and Vincent Villain, editors, Stabilization, Safety, and Security of Distributed Systems, volume 6976 of Lecture Notes in Computer Science, pages 92--107. Springer Berlin Heidelberg, 2011. Google Scholar
Digital Library
- Quentin Bramas and Sébastien Tixeuil. Asynchronous pattern formation without chirality. CoRR, abs/1508.03714, 2015.Google Scholar
- Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, and Peter Widmayer. Arbitrary pattern formation by asynchronous, anonymous, oblivious robots. Theor. Comput. Sci., 407(1--3):412--447, 2008. Google ScholarDigital Library
- Giuseppe Prencipe. Impossibility of gathering by a set of autonomous mobile robots. Theoretical Computer Science, 384(2):222--231, 2007. Google ScholarDigital Library
- Ichiro Suzuki and Masafumi Yamashita. Distributed anonymous mobile robots: Formation of geometric patterns. SIAM J. Comput., 28(4):1347--1363, 1999. Google ScholarDigital Library
- Yukiko Yamauchi and Masafumi Yamashita. Pattern formation by mobile robots with limited visibility. In Thomas Moscibroda and Adele A. Rescigno, editors, Structural Information and Communication Complexity - 20th International Colloquium, SIROCCO 2013, Ischia, Italy, July 1--3, 2013, Revised Selected Papers, volume 8179 of Lecture Notes in Computer Science, pages 201--212. Springer, 2013.Google Scholar
- Yukiko Yamauchi and Masafumi Yamashita. Randomized pattern formation algorithm for asynchronous oblivious mobile robots. In Fabian Kuhn, editor, Distributed Computing, volume 8784 of Lecture Notes in Computer Science, pages 137--151. Springer Berlin Heidelberg, 2014.Google Scholar
Index Terms
- Brief Announcement: Probabilistic Asynchronous Arbitrary Pattern Formation
Recommendations
Brief Announcement: Pattern Formation Problem for Synchronous Mobile Robots in the Three Dimensional Euclidean Space
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingWe investigate the pattern formation problem that requires a swarm of autonomous mobile robots to form a given target pattern in the three-dimensional Euclidean space. We show a necessary and sufficient condition for synchronous robots to form a given ...
Brief Announcement: An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingOver the past 30 years numerous algorithms have been designed for symmetry breaking problems in the LOCAL model, such as maximal matching, MIS, vertex coloring, and edge-coloring. For most problems the best randomized algorithm is at least exponentially ...
Brief announcement: leader election vs pattern formation
PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computingIn this paper, we study the relationship between two fundammental problem in Robotics namely, leader election problem and pattern formation problem. In particular, we prove that both problems are equivalent for n≥4 in a fully asynchronous model, called ...
Comments