Subhash Bhagat ; Abhinav Chakraborty ; Bibhuti Das ; Krishnendu Mukhopadhyaya - Gathering over Meeting Nodes in Infinite Grid

fi:8841 - Fundamenta Informaticae, October 21, 2022, Volume 187, Issue 1
Gathering over Meeting Nodes in Infinite Grid

Authors: 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.


    Volume: Volume 187, Issue 1
    Published on: October 21, 2022
    Accepted on: August 4, 2022
    Submitted on: December 14, 2021
    Keywords: Computer Science - Distributed, Parallel, and Cluster Computing

    Share

    Consultation statistics

    This page has been seen 14 times.
    This article's PDF has been downloaded 15 times.