1 citations · 1 across the 6 of their papers we have counts for
5 papers · 1 filter
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 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…
On the improvement of the in-place merge algorithm parallelization
Berenger Bramas, Quentin Bramas
In this paper, we present several improvements in the parallelization of the in-place merge algorithm, which merges two contiguous sorted arrays into one with an O(T) space complex…
Infinite Grid Exploration by Disoriented Robots
Quentin Bramas, Stephane Devismes, Pascal Lafourcade
We deal with a set of autonomous robots moving on an infinite grid. Those robots are opaque, have limited visibility capabilities, and run using synchronous Look-Compute-Move cycle…