eng
episciences.org
Fundamenta Informaticae
0169-2968
1875-8681
2022-10-21
Volume 187, Issue 1
10.46298/fi-2022-8841
8841
journal article
Gathering over Meeting Nodes in Infinite Grid
Subhash Bhagat
Abhinav Chakraborty
Bibhuti Das
Krishnendu Mukhopadhyaya
The gathering over meeting nodes problem asks the robots to gather at one of
the pre-defined meeting nodes. The robots are deployed on the nodes of an
anonymous two-dimensional infinite grid which has a subset of nodes marked as
meeting nodes. Robots are identical, autonomous, anonymous and oblivious. They
operate under an asynchronous scheduler. They do not have any agreement on a
global coordinate system. All the initial configurations for which the problem
is deterministically unsolvable have been characterized. A deterministic
distributed algorithm has been proposed to solve the problem for the remaining
configurations. The efficiency of the proposed algorithm is studied in terms of
the number of moves required for gathering. A lower bound concerning the total
number of moves required to solve the gathering problem has been derived.
https://fi.episciences.org/8841/pdf
Computer Science - Distributed, Parallel, and Cluster Computing