The Online Freeze-Tag Problem

DSpace Repository

The Online Freeze-Tag Problem

Show full item record

Files for download


Simple item record

Publication Conference Paper, peer reviewed
Title The Online Freeze-Tag Problem
Author(s) Hammar, Mikael ; Nilsson, Bengt J ; Persson, Mia
Date 2006
Editor(s) Correa, José R; Hevia, Alejandro; Kiwi, Marcos
English 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.
DOI (link to publisher's fulltext)
Publisher Springer Verlag
Host/Issue LATIN 2006: Theoretical Informatics
Series/Issue Lecture Notes in Computer Science;3887
ISSN 0302-9743
ISBN 978-3-540-32755-4
Pages p 569-579
Language eng (iso)
Subject(s) Sciences
Research Subject Categories::MATHEMATICS::Applied mathematics::Theoretical computer science
Research Subject Categories::TECHNOLOGY::Information technology::Computer science::Computer science
Note 7th Latin American Symposium on Theoretical Informatics, Valdivia, Chile, March 20-24, 2006
Handle (link to this page)

This item appears in the following Collection(s)

Show full item record



My Account