We present the first (deterministic) algorithm for the Near-Gathering problem, to the best of our knowledge, which allows a set of autonomous mobile robots to nearly gather within finite time without ever colliding. Our algorithm assumes some reasonable conditions on the input configuration (the Near-Gathering problem is easily seen to be unsolvable in general). Further, all the robots are assumed to have a com- pass (hence they agree on the “North” direction), but they do not necessarily have the same handedness (hence they may disagree on the clockwise direction). We also show how the robots can detect termination, i.e., detect when the Near- Gathering problem has been solved. This is crucial when the robots have to perform a generic task after having nearly gathered. We show that termination detection can be obtained even if the total number of robots is unknown to the robots themselves (i.e., it is not a parameter of the algorithm), and robots have no way to explicitly communicate.


    Access

    Download


    Export, share and cite



    Title :

    Getting close without touching: near-gathering for autonomous mobile robots



    Publication date :

    2015-01-01



    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Classification :

    DDC:    629



    Autonomous Mobile Robots

    H. P. Moravec | NTIS | 1986


    Gathering of robots in a ring with mobile faults

    Das, Shantanu / Focardi, Riccardo / Luccio, Flaminia L. et al. | BASE | 2019

    Free access

    Robots and Information Gathering

    Shaker, S. | British Library Conference Proceedings | 1994


    Autonomous recharging of mobile robots

    Birk,A. / Vrije Univ.Brussel,BE | Automotive engineering | 1997


    Navigating semi-autonomous mobile robots

    STORFER LIOR / GAIDAR TAMARA / LAPIDOT IDO | European Patent Office | 2020

    Free access