HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Fault-tolerant and Self-stabilizing Mobile Robots Gathering - Feasibility Study -

Abstract : Gathering is a fundamental coordination problem in cooperative mobile robotics. In short, given a set of robots with arbitrary initial location and no initial agreement on a global coordinate system, gathering requires that all robots, following their algorithm, reach the exact same but not predetermined location. In this paper, we significantly extend the studies of deterministic gathering feasibility under different assumptions related to synchrony and faults (crash and Byzantine). Unlike prior work, we consider a larger set of scheduling strategies, such as bounded schedulers, and derive interesting lower bounds on these schedulers. In addition, we extend our study to the feasibility of probabilistic gathering in both fault-free and fault-prone environments. To the best of our knowledge our work is the first to address the gathering from a probabilistic point of view. \\ Nous étudions la faisabilité (deterministe et probabiliste) du problème de rassemblement d'un ensemble de robots mobiles. Dans le modèle considéré les robots peuvent exhiber un comportement byzantin.
Document type :
Complete list of metadata

Contributor : Anne Jaigu Connect in order to contact the contributor
Submitted on : Thursday, May 18, 2006 - 3:47:40 PM
Last modification on : Friday, February 4, 2022 - 3:31:05 AM
Long-term archiving on: : Saturday, April 3, 2010 - 11:24:50 PM


  • HAL Id : inria-00069600, version 1


Xavier Défago, Maria Gradinariu, Stéphane Messika, Philippe Raïpin-Parvédy. Fault-tolerant and Self-stabilizing Mobile Robots Gathering - Feasibility Study -. [Research Report] PI 1802, 2006, pp.20. ⟨inria-00069600⟩



Record views


Files downloads