Advertisement
Published in:
2015 | OriginalPaper | Chapter
Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement
Authors : Subhash Bhagat, Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya
Published in: WALCOM: Algorithms and Computation
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In this paper, we have studied one of the fundamental coordination problems for multi robot system, namely
gathering
, for
n
≥ 2 asynchronous, oblivious mobile robots in the presence of
f
<
n
faulty robots. Earlier works have reported that, in general, to solve gathering problem for asynchronous robots, many assumptions are required, like multiplicity detection or total agreement in coordinate axis or constant amount of memory bits. However, in this paper we have proved that gathering of asynchronous robots is possible with less number of such assumptions and even in the presence of any number of faulty robots. In our case, the robots only agree on the direction and orientation of any one axis.