Approximation algorithms for the freeze tag problem inside polygons

Abstract

The Freeze Tag Problem (FTP) aims at awakening a swarm of robots with one or more initial awake robots as soon as possible. Each awake robot must touch an sleeping robot to awake it. Once a robot is awakened, it can assist in awakening other sleeping robots. We study this problem inside a polygonal domain and present approximation algorithms for it.