Distributed Algorithms for Treasure Hunt and Variations of Black Hole

Abstract

In the last decade, designing distributed algorithms for mobile entities (such as mobile agents) has garnered a lot of interest. There are many fundamental problems in this domain, among them our focus in this thesis has been on search and exploration problems. The thesis diversifies from an underlying topology being a continuous domain (such as the Euclidean plane) to a discrete domain (i.e., a graph network). Under the graph networks, the thesis focuses on both static as well as dynamic graphs. The first two problems broadly fall under the class of search problems.