Distributed Algorithms to SolveMIS Filling,Mutual Visibility and UniformPartitioning with Luminous Mobile Robots
| dc.contributor.author | Pramanick, Subhajit | |
| dc.date.accessioned | 2024-12-13T10:07:06Z | |
| dc.date.available | 2024-12-13T10:07:06Z | |
| dc.date.issued | 2024 | |
| dc.description | Supervisor: Mandal, Partha Sarathi | |
| dc.description.abstract | "The coordination among a large number of autonomous mobile robots, also known as swarmrobots, has gained significant interest in recent years. Under the framework of Look- Compute-Move cycles, the robots can performvarious tasks such as exploration, gathering, pattern formation, dispersion, scattering and others. This thesis mainly deals with three different types of problems using a swarmof autonomous, anonymous and luminous mobile robots. The first problem falls into the class of graph exploration problems where we study the graph filling problem, named MIS Filling Problem. For an arbitrary connected graph with specific vertices, called Doors, the problem aims to fill the vertices using robots with limited visibility, entering the graph through the Door, such that the set of the occupied vertices forms a maximal independent set (MIS) of the graph. We propose algorithms for two versions of the problem: (1) Single Door under the asynchronous setting and (2) Multiple Doors under the semi-synchronous setting. We also discuss the lower bound for the problem for the single Door case. | |
| dc.identifier.other | ROLL NO.186123017 | |
| dc.identifier.uri | https://gyan.iitg.ac.in/handle/123456789/2765 | |
| dc.language.iso | en | |
| dc.relation.ispartofseries | TH-3475 | |
| dc.title | Distributed Algorithms to SolveMIS Filling,Mutual Visibility and UniformPartitioning with Luminous Mobile Robots | |
| dc.type | Thesis |
Files
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed to upon submission
- Description: