Name
Abstract | ||
|---|---|---|
We study a Rendezvous problem for 2 autonomous mobile robots in asynchronous settings with persistent memory called light. It is well known that Rendezvous is impossible when robots have no lights in basic common models, even if the system is semi-synchronous. On the other hand, Rendezvous is possible if robots have lights with a constant number of colors in several types of lights [9, 21]. In asynchronous settings, Rendezvous can be solved by robots with 3 colors of lights in non-rigid movement and with 2 colors of lights in rigid movement, respectively [21], if the robots can use not only their own light but also the other robot’s light (full-light), where non-rigid movement means robots may be stopped before reaching the computed destination but can move a minimum distance \\(\\delta \u003e0\\), and rigid movement means robots can reach the computed destination. In semi-synchronous settings, Rendezvous can be solved with 2 colors of full-lights in non-rigid movement. |
Year | Venue | DocType |
|---|---|---|
2018 | Adventures Between Lower Bounds and Higher Altitudes | Conference |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Takashi Okumura | 1 | 43 | 14.78 |
| Koichi Wada | 2 | 319 | 54.11 |
| Yoshiaki Katayama | 3 | 226 | 40.42 |