| تعداد نشریات | 43 |
| تعداد شمارهها | 1,830 |
| تعداد مقالات | 14,887 |
| تعداد مشاهده مقاله | 40,829,893 |
| تعداد دریافت فایل اصل مقاله | 15,840,835 |
Approximation algorithms for the freeze tag problem inside polygons | ||
| Transactions on Combinatorics | ||
| دوره 15، شماره 2، شهریور 2026، صفحه 137-145 اصل مقاله (817.62 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22108/toc.2025.143753.2229 | ||
| نویسندگان | ||
| Fatemeh Rajabi-Alni* 1؛ Behrouz Minaei-Bidgoli1؛ Alireza Bagheri2 | ||
| 1Department of Computer Engineering, Iran University of Science and Technology, Tehran, Iran | ||
| 2Computer Engineering Department, Amirkabir University of Technology (Tehran Polytechnic), Tehran, Iran | ||
| چکیده | ||
| The freeze tag problem (FTP) aims to awaken a swarm of robots with one or more initially 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. | ||
| کلیدواژهها | ||
| Freeze tag problem؛ swarm robotics؛ polygonal domain؛ $t$-spanner؛ geodesic graphs | ||
| مراجع | ||
|
[1] Y. Z. A. Lubiw, The visibility freeze-tag problem, 24th annual fall workshop on computational geometry (FWCG), University of Connecticut, (2014). [6] D. Albiero, A. P. Garcia, C. K. Umezu and R. L. de Paulo, Swarm robots in mechanized agricultural operations: A review about challenges for research, Comput. Electron. Agric., 193 (2022) p. 106608. | ||
|
آمار تعداد مشاهده مقاله: 308 تعداد دریافت فایل اصل مقاله: 99 |
||