We consider the following problem from swarm robotics: given one or more "awake" robots in some metric space M, wake up a set of "asleep" robots. A robot awakens a sleeping robot by moving to the sleeping robot's position. When a robot awakens, it is available to assist in awakening other slumbering robots. We investigate offline and online versions of this problem and give a 2-competitive strategy and a lower bound of 2 in the case when M is discrete and the objective is to minimize the total movement cost. We also study the case when M is continuous and show a lower bound of 7/3 when the objective is to minimize the time when the last robot awakens. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Hammar, M., Nilsson, B. J., & Persson, M. (2006). The online freeze-tag problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3887 LNCS, pp. 569–579). https://doi.org/10.1007/11682462_53
Mendeley helps you to discover research relevant for your work.