Efficient Self-stabilizing Simulations of Energy-Restricted Mobile Robots by Asynchronous Luminous Mobile Robots
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910358905552896 |
|---|---|
| author | Nakajima, Keita Takase, Kaito Wada, Koichi |
| author_facet | Nakajima, Keita Takase, Kaito Wada, Koichi |
| contents | In this study, we explore efficient simulation implementations to demonstrate computational equivalence across various models of autonomous mobile robot swarms. Our focus is on Rsynch, a scheduler designed for energy-restricted robots, which falls between Fsynch and Ssynch. We propose efficient protocols for simulating n(>=2) luminous (LUMI) robots operating in Rsynch using LUMI robots in Ssynch or Asynch. Our contributions are twofold: (1) We introduce protocols that simulate LUMI robots in Rsynch using 4k colors in Ssynch and 5k colors in Asynch, for algorithms that employ k colors. This approach notably reduces the number of colors needed for Ssynch simulations of Rsynch, compared to previous efforts. Meanwhile, the color requirement for Asynch simulations remains consistent with previous Asynch simulations of Ssynch, facilitating the simulation of Rsynch in Asynch. (2) We establish that for n=2, Rsynch can be optimally simulated in Asynch using a minimal number of colors. Additionally, we confirm that all our proposed simulation protocols are self-stabilizing, ensuring functionality from any initial configuration. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_05542 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Efficient Self-stabilizing Simulations of Energy-Restricted Mobile Robots by Asynchronous Luminous Mobile Robots Nakajima, Keita Takase, Kaito Wada, Koichi Distributed, Parallel, and Cluster Computing Robotics In this study, we explore efficient simulation implementations to demonstrate computational equivalence across various models of autonomous mobile robot swarms. Our focus is on Rsynch, a scheduler designed for energy-restricted robots, which falls between Fsynch and Ssynch. We propose efficient protocols for simulating n(>=2) luminous (LUMI) robots operating in Rsynch using LUMI robots in Ssynch or Asynch. Our contributions are twofold: (1) We introduce protocols that simulate LUMI robots in Rsynch using 4k colors in Ssynch and 5k colors in Asynch, for algorithms that employ k colors. This approach notably reduces the number of colors needed for Ssynch simulations of Rsynch, compared to previous efforts. Meanwhile, the color requirement for Asynch simulations remains consistent with previous Asynch simulations of Ssynch, facilitating the simulation of Rsynch in Asynch. (2) We establish that for n=2, Rsynch can be optimally simulated in Asynch using a minimal number of colors. Additionally, we confirm that all our proposed simulation protocols are self-stabilizing, ensuring functionality from any initial configuration. |
| title | Efficient Self-stabilizing Simulations of Energy-Restricted Mobile Robots by Asynchronous Luminous Mobile Robots |
| topic | Distributed, Parallel, and Cluster Computing Robotics |
| url | https://arxiv.org/abs/2403.05542 |