34 citations · 48 across the 13 of their papers we have counts for
17 papers
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…
Stand Up Indulgent Rendezvous
Quentin Bramas, Anissa Lamani, Sébastien Tixeuil
We consider two mobile oblivious robots that evolve in a continuous Euclidean space. We require the two robots to solve the rendezvous problem (meeting in finite time at the same l…
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…