Brief announcement: Pattern formation problem for synchronous mobile robots in the three dimensional euclidean space

Yukiko Yamauchi; Taichi Uehara; Masafumi Yamashita

doi:10.1145/2933057.2933063

Brief announcement: Pattern formation problem for synchronous mobile robots in the three dimensional euclidean space

Yukiko Yamauchi, Taichi Uehara, Masafumi Yamashita

Mathematical Informatics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

17 Citations (Scopus)

Abstract

We 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 target pattern from an initial configuration. We give a pattern formation algorithm for solvable instances that does not need any local memory at each robot.

Original language	English
Title of host publication	PODC 2016 - Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing
Publisher	Association for Computing Machinery
Pages	447-449
Number of pages	3
ISBN (Electronic)	9781450339643
DOIs	https://doi.org/10.1145/2933057.2933063
Publication status	Published - Jul 25 2016
Event	35th ACM Symposium on Principles of Distributed Computing, PODC 2016 - Chicago, United States Duration: Jul 25 2016 → Jul 28 2016

Publication series

Name	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
Volume	25-28-July-2016

Other

Other	35th ACM Symposium on Principles of Distributed Computing, PODC 2016
Country/Territory	United States
City	Chicago
Period	7/25/16 → 7/28/16

All Science Journal Classification (ASJC) codes

Software
Hardware and Architecture
Computer Networks and Communications

Access to Document

10.1145/2933057.2933063

Cite this

Yamauchi, Y., Uehara, T., & Yamashita, M. (2016). Brief announcement: Pattern formation problem for synchronous mobile robots in the three dimensional euclidean space. In PODC 2016 - Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (pp. 447-449). (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing; Vol. 25-28-July-2016). Association for Computing Machinery. https://doi.org/10.1145/2933057.2933063

Brief announcement : Pattern formation problem for synchronous mobile robots in the three dimensional euclidean space. / Yamauchi, Yukiko; Uehara, Taichi; Yamashita, Masafumi.

PODC 2016 - Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, 2016. p. 447-449 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing; Vol. 25-28-July-2016).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Yamauchi, Y, Uehara, T & Yamashita, M 2016, Brief announcement: Pattern formation problem for synchronous mobile robots in the three dimensional euclidean space. in PODC 2016 - Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, vol. 25-28-July-2016, Association for Computing Machinery, pp. 447-449, 35th ACM Symposium on Principles of Distributed Computing, PODC 2016, Chicago, United States, 7/25/16. https://doi.org/10.1145/2933057.2933063

Yamauchi Y, Uehara T, Yamashita M. Brief announcement: Pattern formation problem for synchronous mobile robots in the three dimensional euclidean space. In PODC 2016 - Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery. 2016. p. 447-449. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing). doi: 10.1145/2933057.2933063

Yamauchi, Yukiko ; Uehara, Taichi ; Yamashita, Masafumi. / Brief announcement : Pattern formation problem for synchronous mobile robots in the three dimensional euclidean space. PODC 2016 - Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, 2016. pp. 447-449 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

@inproceedings{da7d3c4054604410984d3a7f5c0e4106,

title = "Brief announcement: Pattern formation problem for synchronous mobile robots in the three dimensional euclidean space",

abstract = "We 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 target pattern from an initial configuration. We give a pattern formation algorithm for solvable instances that does not need any local memory at each robot.",

author = "Yukiko Yamauchi and Taichi Uehara and Masafumi Yamashita",

note = "Publisher Copyright: {\textcopyright} 2016 ACM.; 35th ACM Symposium on Principles of Distributed Computing, PODC 2016 ; Conference date: 25-07-2016 Through 28-07-2016",

year = "2016",

month = jul,

day = "25",

doi = "10.1145/2933057.2933063",

language = "English",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

publisher = "Association for Computing Machinery",

pages = "447--449",

booktitle = "PODC 2016 - Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing",

}

TY - GEN

T1 - Brief announcement

T2 - 35th ACM Symposium on Principles of Distributed Computing, PODC 2016

AU - Yamauchi, Yukiko

AU - Uehara, Taichi

AU - Yamashita, Masafumi

PY - 2016/7/25

Y1 - 2016/7/25

N2 - We 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 target pattern from an initial configuration. We give a pattern formation algorithm for solvable instances that does not need any local memory at each robot.

AB - We 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 target pattern from an initial configuration. We give a pattern formation algorithm for solvable instances that does not need any local memory at each robot.

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

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

U2 - 10.1145/2933057.2933063

DO - 10.1145/2933057.2933063

M3 - Conference contribution

AN - SCOPUS:84984688345

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 447

EP - 449

BT - PODC 2016 - Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing

PB - Association for Computing Machinery

Y2 - 25 July 2016 through 28 July 2016

ER -

Brief announcement: Pattern formation problem for synchronous mobile robots in the three dimensional euclidean space

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this