Approximation Algorithms for the Freeze Tag Problem inside Polygons
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866929576839479296 |
|---|---|
| author | Rajabi-Alni, Fatemeh Bagheri, Alireza Minaei-Bidgoli, Behrouz |
| author_facet | Rajabi-Alni, Fatemeh Bagheri, Alireza Minaei-Bidgoli, Behrouz |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_02882 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Approximation Algorithms for the Freeze Tag Problem inside Polygons Rajabi-Alni, Fatemeh Bagheri, Alireza Minaei-Bidgoli, Behrouz Computational Geometry 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. |
| title | Approximation Algorithms for the Freeze Tag Problem inside Polygons |
| topic | Computational Geometry |
| url | https://arxiv.org/abs/2411.02882 |