5 citations · 7 across the 9 of their papers we have counts for
13 papers
The R(1)W(1) Communication Model for Self-Stabilizing Distributed Algorithms
Hirotsugu Kakugawa, Sayaka Kamei, Masahiro Shibata +1
Self-stabilization is a versatile methodology in the design of fault-tolerant distributed algorithms for transient faults. A self-stabilizing system automatically recovers from any…
Stand-Up Indulgent Gathering on Rings
Quentin Bramas, Sayaka Kamei, Anissa Lamani +1
We consider a collection of robots that evolve in a ring-shaped network without common orientation, and address a variant of the crash-tolerant gathering problem called…
Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots
Quentin Bramas, Hirotsugu Kakugawa, Sayaka Kamei +4
We consider a strong variant of the crash fault-tolerant gathering problem called stand-up indulgent gathering (SUIG), by robots endowed with limited visibility sensors and lights…
Stand-Up Indulgent Gathering on Lines
Quentin Bramas, Sayaka Kamei, Anissa Lamani +1
We consider a variant of the crash-fault gathering problem called stand-up indulgent gathering (SUIG). In this problem, a group of mobile robots must eventually gather at a single…
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…
Self-stabilizing Graph Exploration by a Single Agent
Yuichi Sudo, Fukuhito Ooshita, Sayaka Kamei
In this paper, we present two self-stabilizing algorithms that enable a single (mobile) agent to explore graphs. Starting from any initial configuration, \ie regardless of the init…
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…
Gathering an even number of robots in an odd ring without global multiplicity detection
Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita +1
We propose a gathering protocol for an even number of robots in a ring-shaped network that allows symmetric but not periodic configurations as initial configurations, yet uses only…
Asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection
Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita +1
We consider a set of k autonomous robots that are endowed with visibility sensors (but that are otherwise unable to communicate) and motion actuators. Those robots must collaborate…