1 citations · 2 across the 4 of their papers we have counts for
11 papers · 1 filter
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…