The online freeze-tag problem

Authors:
Mikael Hammar;Bengt J. Nilsson;Mia Persson
Affiliations:
Apptus Technologies AB, IDEON, Lund, Sweden;School of Technology and Society, Malmö University, Malmö, Sweden;School of Technology and Society, Malmö University, Malmö, Sweden
Venue:
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Year:
2006

Citing 6
Cited 0

Competitive algorithms for server problems

Journal of Algorithms
On the k-server conjecture

Journal of the ACM (JACM)
Online computation and competitive analysis

Online computation and competitive analysis
The freeze-tag problem: how to wake up a swarm of robots

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Analysis of Heuristics for the Freeze-Tag Problem

SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Improved approximation algorithms for the freeze-tag problem

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.