Randomized pattern formation algorithm for asynchronous oblivious mobile robots

Yukiko Yamauchi, Masafumi Yamashita

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Citations (Scopus)

Abstract

We present a randomized pattern formation algorithm for asynchronous oblivious (i.e., memory-less) mobile robots that enables formation of any target pattern. As for deterministic pattern formation algorithms, the class of patterns formable from an initial configuration I is characterized by the symmetricity (i.e., the order of rotational symmetry) of I, and in particular, every pattern is formable from I if its symmetricity is 1. The randomized pattern formation algorithm ψPF we present in this paper consists of two phases: The first phase transforms a given initial configuration I into a configuration I′ such that its symmetricity is 1, and the second phase invokes a deterministic pattern formation algorithm ψCWM by Fujinaga et al. (DISC 2012) for asynchronous oblivious mobile robots to finally form the target pattern.

There are two hurdles to overcome to realize ψPF . First, all robots must simultaneously stop and agree on the end of the first phase, to safely start the second phase, since the correctness of ψCWM is guaranteed only for an initial configuration in which all robots are stationary. Second, the sets of configurations in the two phases must be disjoint, so that even oblivious robots can recognize which phase they are working on. We provide a set of tricks to overcome these hurdles.

Original languageEnglish
Title of host publicationDistributed Computing - 28th International Symposium, DISC 2014, Proceedings
EditorsFabian Kuhn
PublisherSpringer Verlag
Pages137-151
Number of pages15
ISBN (Electronic)9783662451731
Publication statusPublished - Jan 1 2014
Event28th International Symposium on Distributed Computing, DISC 2014 - Austin, United States
Duration: Oct 12 2014Oct 15 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8784
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other28th International Symposium on Distributed Computing, DISC 2014
CountryUnited States
CityAustin
Period10/12/1410/15/14

Fingerprint

Pattern Formation
Mobile Robot
Mobile robots
Configuration
Robots
Robot
Target
Rotational symmetry
Correctness
Disjoint
Data storage equipment
Transform

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Yamauchi, Y., & Yamashita, M. (2014). Randomized pattern formation algorithm for asynchronous oblivious mobile robots. In F. Kuhn (Ed.), Distributed Computing - 28th International Symposium, DISC 2014, Proceedings (pp. 137-151). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8784). Springer Verlag.

Randomized pattern formation algorithm for asynchronous oblivious mobile robots. / Yamauchi, Yukiko; Yamashita, Masafumi.

Distributed Computing - 28th International Symposium, DISC 2014, Proceedings. ed. / Fabian Kuhn. Springer Verlag, 2014. p. 137-151 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8784).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yamauchi, Y & Yamashita, M 2014, Randomized pattern formation algorithm for asynchronous oblivious mobile robots. in F Kuhn (ed.), Distributed Computing - 28th International Symposium, DISC 2014, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8784, Springer Verlag, pp. 137-151, 28th International Symposium on Distributed Computing, DISC 2014, Austin, United States, 10/12/14.
Yamauchi Y, Yamashita M. Randomized pattern formation algorithm for asynchronous oblivious mobile robots. In Kuhn F, editor, Distributed Computing - 28th International Symposium, DISC 2014, Proceedings. Springer Verlag. 2014. p. 137-151. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Yamauchi, Yukiko ; Yamashita, Masafumi. / Randomized pattern formation algorithm for asynchronous oblivious mobile robots. Distributed Computing - 28th International Symposium, DISC 2014, Proceedings. editor / Fabian Kuhn. Springer Verlag, 2014. pp. 137-151 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{9077291420da47d2a2d1f6c896a9b2f7,
title = "Randomized pattern formation algorithm for asynchronous oblivious mobile robots",
abstract = "We present a randomized pattern formation algorithm for asynchronous oblivious (i.e., memory-less) mobile robots that enables formation of any target pattern. As for deterministic pattern formation algorithms, the class of patterns formable from an initial configuration I is characterized by the symmetricity (i.e., the order of rotational symmetry) of I, and in particular, every pattern is formable from I if its symmetricity is 1. The randomized pattern formation algorithm ψPF we present in this paper consists of two phases: The first phase transforms a given initial configuration I into a configuration I′ such that its symmetricity is 1, and the second phase invokes a deterministic pattern formation algorithm ψCWM by Fujinaga et al. (DISC 2012) for asynchronous oblivious mobile robots to finally form the target pattern.There are two hurdles to overcome to realize ψPF . First, all robots must simultaneously stop and agree on the end of the first phase, to safely start the second phase, since the correctness of ψCWM is guaranteed only for an initial configuration in which all robots are stationary. Second, the sets of configurations in the two phases must be disjoint, so that even oblivious robots can recognize which phase they are working on. We provide a set of tricks to overcome these hurdles.",
author = "Yukiko Yamauchi and Masafumi Yamashita",
year = "2014",
month = "1",
day = "1",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "137--151",
editor = "Fabian Kuhn",
booktitle = "Distributed Computing - 28th International Symposium, DISC 2014, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Randomized pattern formation algorithm for asynchronous oblivious mobile robots

AU - Yamauchi, Yukiko

AU - Yamashita, Masafumi

PY - 2014/1/1

Y1 - 2014/1/1

N2 - We present a randomized pattern formation algorithm for asynchronous oblivious (i.e., memory-less) mobile robots that enables formation of any target pattern. As for deterministic pattern formation algorithms, the class of patterns formable from an initial configuration I is characterized by the symmetricity (i.e., the order of rotational symmetry) of I, and in particular, every pattern is formable from I if its symmetricity is 1. The randomized pattern formation algorithm ψPF we present in this paper consists of two phases: The first phase transforms a given initial configuration I into a configuration I′ such that its symmetricity is 1, and the second phase invokes a deterministic pattern formation algorithm ψCWM by Fujinaga et al. (DISC 2012) for asynchronous oblivious mobile robots to finally form the target pattern.There are two hurdles to overcome to realize ψPF . First, all robots must simultaneously stop and agree on the end of the first phase, to safely start the second phase, since the correctness of ψCWM is guaranteed only for an initial configuration in which all robots are stationary. Second, the sets of configurations in the two phases must be disjoint, so that even oblivious robots can recognize which phase they are working on. We provide a set of tricks to overcome these hurdles.

AB - We present a randomized pattern formation algorithm for asynchronous oblivious (i.e., memory-less) mobile robots that enables formation of any target pattern. As for deterministic pattern formation algorithms, the class of patterns formable from an initial configuration I is characterized by the symmetricity (i.e., the order of rotational symmetry) of I, and in particular, every pattern is formable from I if its symmetricity is 1. The randomized pattern formation algorithm ψPF we present in this paper consists of two phases: The first phase transforms a given initial configuration I into a configuration I′ such that its symmetricity is 1, and the second phase invokes a deterministic pattern formation algorithm ψCWM by Fujinaga et al. (DISC 2012) for asynchronous oblivious mobile robots to finally form the target pattern.There are two hurdles to overcome to realize ψPF . First, all robots must simultaneously stop and agree on the end of the first phase, to safely start the second phase, since the correctness of ψCWM is guaranteed only for an initial configuration in which all robots are stationary. Second, the sets of configurations in the two phases must be disjoint, so that even oblivious robots can recognize which phase they are working on. We provide a set of tricks to overcome these hurdles.

UR - http://www.scopus.com/inward/record.url?scp=84910659798&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84910659798&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84910659798

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 137

EP - 151

BT - Distributed Computing - 28th International Symposium, DISC 2014, Proceedings

A2 - Kuhn, Fabian

PB - Springer Verlag

ER -