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 | |
| 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 | United States |
| City | Chicago |
| Period | 7/25/16 → 7/28/16 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Software
- Hardware and Architecture
- Computer Networks and Communications
Cite this
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
}
TY - GEN
T1 - Brief announcement
T2 - Pattern formation problem for synchronous mobile robots in the three dimensional euclidean space
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
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
ER -