Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2407.19175 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929439041912832 |
|---|---|
| author | Yamada, Ryonosuke Usami, Tomoyuki Yamauchi, Yukiko |
| author_facet | Yamada, Ryonosuke Usami, Tomoyuki Yamauchi, Yukiko |
| contents | A metamorphic robotic system (MRS) consists of anonymous modules, each of which autonomously moves in the 2D square grid by sliding and rotation with keeping connectivity among the modules. Existing literature considers distributed coordination among modules so that they collectively form a single MRS. In this paper, we consider distributed coordination for two MRSs. We first present a rendezvous algorithm that makes the two MRSs gather so that each module can observe all the other modules. Then, we present a merge algorithm that makes the two MRSs assemble and establish connectivity after rendezvous is finished. These two algorithms assume that each MRS consists of five modules, that do not have a common coordinate system. Finally, we show that five modules for each MRS is necessary to solve the rendezvous problem. To the best of our knowledge, our result is the first result on distributed coordination of multiple MRSs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_19175 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Rendezvous and Merging for Two Metamorphic Robotic Systems without Global Compass Yamada, Ryonosuke Usami, Tomoyuki Yamauchi, Yukiko Robotics Distributed, Parallel, and Cluster Computing 68M14, C.2.4 A metamorphic robotic system (MRS) consists of anonymous modules, each of which autonomously moves in the 2D square grid by sliding and rotation with keeping connectivity among the modules. Existing literature considers distributed coordination among modules so that they collectively form a single MRS. In this paper, we consider distributed coordination for two MRSs. We first present a rendezvous algorithm that makes the two MRSs gather so that each module can observe all the other modules. Then, we present a merge algorithm that makes the two MRSs assemble and establish connectivity after rendezvous is finished. These two algorithms assume that each MRS consists of five modules, that do not have a common coordinate system. Finally, we show that five modules for each MRS is necessary to solve the rendezvous problem. To the best of our knowledge, our result is the first result on distributed coordination of multiple MRSs. |
| title | Rendezvous and Merging for Two Metamorphic Robotic Systems without Global Compass |
| topic | Robotics Distributed, Parallel, and Cluster Computing 68M14, C.2.4 |
| url | https://arxiv.org/abs/2407.19175 |