Gathering of Mobile Robots in Anonymous Trees

Joseph, A M (2015) Gathering of Mobile Robots in Anonymous Trees. Masters thesis, Indian Institute of Technology Hyderabad.

CS13M1002.pdf - Submitted Version

Download (526kB) | Preview


Gathering problem of mobile robots is a class of graph problem that has a lot of relevance in everyday life. The problem requires a set of mobile robots, initially located at different nodes of a graph, to gather at the same location in the graph, which is not decided before. This report considers the gathering problem of mobile robots in anonymous trees. The robots considered here are identical, do not communicate directly with other robots and also, all the robots execute the same algorithm to achieve gathering. Robots are assumed to have minimal capabilities with respect to the memory associated with them as well as their visibility capability. In this report, three models have been proposed for solving gathering problem under three different scenarios. Possible solutions in each of these models have been described. The current work that has already happened and the future work that can be done in each model have also been mentioned.

[error in script]
IITH Creators:
IITH CreatorsORCiD
Item Type: Thesis (Masters)
Uncontrolled Keywords: Gathering, Anonymous trees, Limited memory, Identical robots, TD307
Subjects: Computer science > Big Data Analytics
Others > Robotics
Divisions: Department of Computer Science & Engineering
Depositing User: Library Staff
Date Deposited: 29 Jun 2015 10:33
Last Modified: 13 May 2019 10:09
Publisher URL:
Related URLs:

Actions (login required)

View Item View Item
Statistics for RAIITH ePrint 1606 Statistics for this ePrint Item