The Visibility Freeze-Tag Problem
MetadataShow full item record
In the Freeze-Tag Problem, we are given a set of robots at points inside some metric space. Initially, all the robots are frozen except one. That robot can awaken (or “unfreeze”) another robot by moving to its position, and once a robot is awakened, it can move and help to awaken other robots. The goal is to awaken all the robots in the shortest time. The Freeze-Tag Problem has been studied in different metric spaces: graphs and Euclidean spaces. In this thesis, we look at the Freeze-Tag Problem in polygons, and we introduce the Visibility Freeze-Tag Problem, where one robot can awaken another robot by “seeing” it. Furthermore, we introduce a variant of the Visibility Freeze-Tag Problem, called the Line/Point Freeze Tag Problem, where each robot lies on an awakening line, and one robot can awaken another robot by touching its awakening line. We survey the current results for the Freeze-Tag Problem in graphs, Euclidean spaces and polygons. Since the Visibility Freeze-Tag Problem bears some resemblance to the Watchman Route Problem, we also survey the background literature on the Watchman Route Problem. We show that the Freeze-Tag Problem in polygons and the Visibility Freeze-Tag Problem are NP-hard, and we present an O(n)-approximation algorithm for the Visibility Freeze-Tag Problem. For the Line/Point Freeze-Tag Problem, we give a polynomial time algorithm for the special case where all the awakening lines are parallel to each other. We prove that the general case is NP-hard, and we present an O(1)- approximation algorithm.
Cite this version of the work
Yizhe Zeng (2014). The Visibility Freeze-Tag Problem. UWSpace. http://hdl.handle.net/10012/8690