The freeze tag problem (FTP) aims to awaken a swarm of robots with one or more initial awake robots as soon as possible. Each awake robot must touch a sleeping robot to wake it up. 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.
Cite
@article{arxiv.2411.02882,
title = {Approximation Algorithms for the Freeze Tag Problem inside Polygons},
author = {Fatemeh Rajabi-Alni and Alireza Bagheri and Behrouz Minaei-Bidgoli},
journal= {arXiv preprint arXiv:2411.02882},
year = {2024}
}