Gathering at fixed nodes by oblivious mobile robots/ Abhinav Chakraborty

Thesis (Ph.D) - Indian Statistical Institute, 2023

Includes bibliography

Introduction -- Related Works -- Gathering over Meeting Nodes in Infinite Grid -- Optimal Gathering over Weber Meeting Nodes in Infinite Grid -- Gathering over Heterogeneous Meeting Nodes -- Parking Problem in Infinite Grids --

Guided by Prof. Krishnendu Mukhopadhyaya

A swarm of robots is a distributed system of small, autonomous, inexpensive mobile robots that work collaboratively to achieve some specific goal. This thesis aims to study the gathering problem, which is a fundamental coordination problem. In the initial configuration, the robots are located at distinct nodes of an input graph. The main objective of the problem is that all the robots must meet at a point. In this thesis, the deployment space of the robots is assumed to be an infinite grid graph. This thesis considers the gathering over meeting nodes problem in an infinite grid do- main. The input grid graph consists of some nodes which are marked as meeting nodes. The problem requires the mobile robots to gather at one of the pre-fixed meeting nodes. Several variations of the problem have been considered. All the initial configurations for which the problem is deterministically unsolvable have been characterized. A deter- ministic distributed algorithm has been proposed to solve the problem for the remaining configurations. The problem has also been studied under the objective function that minimizes the total number of moves made by all the robots to finalize the gathering task. A deterministic distributed algorithm has been proposed to solve the problem for all those solvable configurations, and the initial configurations for which the problem is unsolvable have been characterized. The proposed gathering algorithm is optimal with respect to the total number of moves performed by all the robots in order to finalize the gathering. Another variation of the problem considers two disjoint and finite groups of anonymous robots. The initial configurations also consist of two finite and disjoint sets of heteroge- neous meeting nodes. The objective is to design a distributed algorithm that gathers all the robots belonging to the first team at one of the meeting nodes belonging to the first type. Similarly, all the robots in the second team must gather at one of the meeting nodes belonging to the second type. The initial configurations for which the gathering problem is unsolvable have been characterized. For the remaining initial configurations, a distributed gathering algorithm has been proposed. The parking problem can also be considered as a variation of the problem. As a solution to the parking problem, the robots need to partition themselves into groups so that each parking node contains a number of robots equal to the capacity of the node. It is assumed that the number of robots in the initial configuration represents the sum of the capacities of the parking nodes. Under this setup, we have characterized all the initial configurations and the values of ki for which the problem is unsolvable. For the remaining configurations, a deterministic distributed algorithm was proposed.