4 citations · 9 across the 5 of their papers we have counts for
9 papers · 1 filter
Complete Visibility Algorithm for Autonomous Mobile Luminous Robots under an Asynchronous Scheduler on Grid Plane
Yonghwan Kim, Yoshiaki Katayama, Koichi Wada
An autonomous mobile robot system is a distributed system consisting of mobile computational entities (called robots) that autonomously and repeatedly perform three operations: Loo…
Asynchronous Gathering in a Torus
Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita +2
We consider the gathering problem for asynchronous and oblivious robots that cannot communicate explicitly with each other, but are endowed with visibility sensors that allow them…
Gathering on Rings for Myopic Asynchronous Robots with Lights
Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita +2
We investigate gathering algorithms for asynchronous autonomous mobile robots moving in uniform ring-shaped networks. Different from most work using the Look-Compute-Move (LCM) mod…
Using Model Checking to Formally Verify Rendezvous Algorithms for Robots with Lights in Euclidean Space
Xavier Défago, Adam Heriban, Sébastien Tixeuil +1
The paper details the first successful attempt at using model-checking techniques to verify the correctness of distributed algorithms for robots evolving in a \emph{continuous} env…
Neighborhood Mutual Remainder: Self-Stabilizing Implementation of Look-Compute-Move Robots (Extended Abstract)
Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama +2
Local mutual exclusion guarantees that no two neighboring processes enter a critical section at the same time while satisfying both mutual exclusion and no starvation properties. O…
Gathering Problems for Autonomous Mobile Robots with Lights
Satoshi Terai, Koichi Wada, Yoshiaki Katayama
We study the Gathering problem for n autonomous mobile robots in semi-synchronous settings with persistent memory called light. It is well known that Gathering is impossible in a b…