1 citations · 2 across the 3 of their papers we have counts for
7 papers
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…
An Asynchronous Maximum Independent Set Algorithm by Myopic Luminous Robots on Grids
Sayaka Kamei, Sébastien Tixeuil
We consider the problem of constructing a maximum independent set with mobile myopic luminous robots on a grid network whose size is finite but unknown to the robots. In this setti…
Evacuation from Various Types of Finite 2D Square Grid Fields by a Metamorphic Robotic System
Junya Nakamura, Sayaka Kamei, Yukiko Yamauchi
A metamorphic robotic system (MRS) is composed of anonymous, memoryless, and autonomous modules that execute an identical distributed algorithm to move while keeping the connectivi…
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…
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…
An asynchronous message-passing distributed algorithm for the global critical section problem
Sayaka Kamei, Hirotsugu Kakugawa
This paper considers the global -CS problem which is the problem of controlling the system in such a way that, at least and at most processes must be in the CS at a…