Pattern formation through optimum matching by oblivious CORDA robots

Nao Fujinaga, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita

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

14 Citations (Scopus)

Abstract

A (new) geometric pattern formation problem by a set of oblivious, anonymous, asynchronous (i.e., CORDA) robots is investigated in this paper. The conventional pattern formation problem assumes that the target pattern is given as a set of the positions by their coordinates in the global coordinate system, under the assumption that the robots are not aware of it. In the pattern formation problem we discuss in this paper, the points comprising the pattern are assumed to be "visible" to all robots, like landmarks. However, the robots still cannot obtain their positions in the global coordinate system. This paper shows that this pattern formation problem is solvable by oblivious asynchronous robots through the optimum matching between the robots and the pattern's points. Our study is partly motivated by the state-of-arts of the conventional pattern formation problem by oblivious asynchronous robots; description and correctness proof of a formation algorithm is usually complicated and ambiguous, because of the oblivious and asynchronous natures of the robots. A modular method is thus looked for to describe and prove algorithm in a clearer and more concrete way. Our pattern formation problem and the formation algorithm based on the optimum matching are used as a primitive building block in the modular method.

Original languageEnglish
Title of host publicationPrinciples of Distributed Systems - 14th International Conference, OPODIS 2010, Proceedings
Pages1-15
Number of pages15
DOIs
Publication statusPublished - Dec 1 2010
Event14th International Conference on Principles of Distributed Systems, OPODIS 2010 - Tozeur, Tunisia
Duration: Dec 14 2010Dec 17 2010

Publication series

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

Other

Other14th International Conference on Principles of Distributed Systems, OPODIS 2010
CountryTunisia
CityTozeur
Period12/14/1012/17/10

Fingerprint

Pattern Formation
Robot
Robots
Proof of correctness
Landmarks
Ambiguous
Building Blocks
Target

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Fujinaga, N., Ono, H., Kijima, S., & Yamashita, M. (2010). Pattern formation through optimum matching by oblivious CORDA robots. In Principles of Distributed Systems - 14th International Conference, OPODIS 2010, Proceedings (pp. 1-15). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6490 LNCS). https://doi.org/10.1007/978-3-642-17653-1_1

Pattern formation through optimum matching by oblivious CORDA robots. / Fujinaga, Nao; Ono, Hirotaka; Kijima, Shuji; Yamashita, Masafumi.

Principles of Distributed Systems - 14th International Conference, OPODIS 2010, Proceedings. 2010. p. 1-15 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6490 LNCS).

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

Fujinaga, N, Ono, H, Kijima, S & Yamashita, M 2010, Pattern formation through optimum matching by oblivious CORDA robots. in Principles of Distributed Systems - 14th International Conference, OPODIS 2010, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6490 LNCS, pp. 1-15, 14th International Conference on Principles of Distributed Systems, OPODIS 2010, Tozeur, Tunisia, 12/14/10. https://doi.org/10.1007/978-3-642-17653-1_1
Fujinaga N, Ono H, Kijima S, Yamashita M. Pattern formation through optimum matching by oblivious CORDA robots. In Principles of Distributed Systems - 14th International Conference, OPODIS 2010, Proceedings. 2010. p. 1-15. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-17653-1_1
Fujinaga, Nao ; Ono, Hirotaka ; Kijima, Shuji ; Yamashita, Masafumi. / Pattern formation through optimum matching by oblivious CORDA robots. Principles of Distributed Systems - 14th International Conference, OPODIS 2010, Proceedings. 2010. pp. 1-15 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{074858fec4e1411f917edcb0d1426736,
title = "Pattern formation through optimum matching by oblivious CORDA robots",
abstract = "A (new) geometric pattern formation problem by a set of oblivious, anonymous, asynchronous (i.e., CORDA) robots is investigated in this paper. The conventional pattern formation problem assumes that the target pattern is given as a set of the positions by their coordinates in the global coordinate system, under the assumption that the robots are not aware of it. In the pattern formation problem we discuss in this paper, the points comprising the pattern are assumed to be {"}visible{"} to all robots, like landmarks. However, the robots still cannot obtain their positions in the global coordinate system. This paper shows that this pattern formation problem is solvable by oblivious asynchronous robots through the optimum matching between the robots and the pattern's points. Our study is partly motivated by the state-of-arts of the conventional pattern formation problem by oblivious asynchronous robots; description and correctness proof of a formation algorithm is usually complicated and ambiguous, because of the oblivious and asynchronous natures of the robots. A modular method is thus looked for to describe and prove algorithm in a clearer and more concrete way. Our pattern formation problem and the formation algorithm based on the optimum matching are used as a primitive building block in the modular method.",
author = "Nao Fujinaga and Hirotaka Ono and Shuji Kijima and Masafumi Yamashita",
year = "2010",
month = "12",
day = "1",
doi = "10.1007/978-3-642-17653-1_1",
language = "English",
isbn = "3642176526",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "1--15",
booktitle = "Principles of Distributed Systems - 14th International Conference, OPODIS 2010, Proceedings",

}

TY - GEN

T1 - Pattern formation through optimum matching by oblivious CORDA robots

AU - Fujinaga, Nao

AU - Ono, Hirotaka

AU - Kijima, Shuji

AU - Yamashita, Masafumi

PY - 2010/12/1

Y1 - 2010/12/1

N2 - A (new) geometric pattern formation problem by a set of oblivious, anonymous, asynchronous (i.e., CORDA) robots is investigated in this paper. The conventional pattern formation problem assumes that the target pattern is given as a set of the positions by their coordinates in the global coordinate system, under the assumption that the robots are not aware of it. In the pattern formation problem we discuss in this paper, the points comprising the pattern are assumed to be "visible" to all robots, like landmarks. However, the robots still cannot obtain their positions in the global coordinate system. This paper shows that this pattern formation problem is solvable by oblivious asynchronous robots through the optimum matching between the robots and the pattern's points. Our study is partly motivated by the state-of-arts of the conventional pattern formation problem by oblivious asynchronous robots; description and correctness proof of a formation algorithm is usually complicated and ambiguous, because of the oblivious and asynchronous natures of the robots. A modular method is thus looked for to describe and prove algorithm in a clearer and more concrete way. Our pattern formation problem and the formation algorithm based on the optimum matching are used as a primitive building block in the modular method.

AB - A (new) geometric pattern formation problem by a set of oblivious, anonymous, asynchronous (i.e., CORDA) robots is investigated in this paper. The conventional pattern formation problem assumes that the target pattern is given as a set of the positions by their coordinates in the global coordinate system, under the assumption that the robots are not aware of it. In the pattern formation problem we discuss in this paper, the points comprising the pattern are assumed to be "visible" to all robots, like landmarks. However, the robots still cannot obtain their positions in the global coordinate system. This paper shows that this pattern formation problem is solvable by oblivious asynchronous robots through the optimum matching between the robots and the pattern's points. Our study is partly motivated by the state-of-arts of the conventional pattern formation problem by oblivious asynchronous robots; description and correctness proof of a formation algorithm is usually complicated and ambiguous, because of the oblivious and asynchronous natures of the robots. A modular method is thus looked for to describe and prove algorithm in a clearer and more concrete way. Our pattern formation problem and the formation algorithm based on the optimum matching are used as a primitive building block in the modular method.

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

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

U2 - 10.1007/978-3-642-17653-1_1

DO - 10.1007/978-3-642-17653-1_1

M3 - Conference contribution

AN - SCOPUS:78650919777

SN - 3642176526

SN - 9783642176524

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

SP - 1

EP - 15

BT - Principles of Distributed Systems - 14th International Conference, OPODIS 2010, Proceedings

ER -