{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T11:20:56Z","timestamp":1772277656377,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T00:00:00Z","timestamp":1772236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T00:00:00Z","timestamp":1772236800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s10458-026-09738-8","type":"journal-article","created":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T07:32:38Z","timestamp":1772263958000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Geometric freeze-tag problem"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3626-8960","authenticated-orcid":false,"given":"Sharareh","family":"Alipour","sequence":"first","affiliation":[]},{"given":"Arash","family":"Ahadi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0008-4758-8995","authenticated-orcid":false,"given":"Kajal","family":"Baghestani","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0009-4042-3132","authenticated-orcid":false,"given":"Soroush","family":"Sahraei","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0009-3691-3606","authenticated-orcid":false,"given":"Mahdis","family":"Mirzaei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,28]]},"reference":[{"key":"9738_CR1","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N., & Odak, S. (2024). Euclidean freeze-tag problem on plane. In Proceedings of the 36th Canadian Conference on Computational Geometry (CCCG), St. Catharines, Canada, pp. 199\u2013205. https:\/\/cccg.ca\/proceedings\/2024\/CCCG_2024_proceedings.pdf."},{"key":"9738_CR2","doi-asserted-by":"crossref","unstructured":"Alipour, S., Baghestani, K., Mirzaei, M., & Sahraei, S. (2025). Geometric freeze-tag problem. In Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems. AAMAS \u201925, pp. 87\u201395. International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC. https:\/\/dl.acm.org\/doi\/10.5555\/3709347.3743520.","DOI":"10.65109\/ZXSE4458"},{"key":"9738_CR3","unstructured":"Alipour, S., Ahadi, A., & Baghestani, K. (2025). Improved wake-up time for euclidean freeze-tag problem. In Proceedings of the 37th Canadian Conference on Computational Geometry (CCCG), Toronto, Canada. https:\/\/cccg-wads-2025.eecs.yorku.ca\/cccg-papers\/7A4.pdf."},{"key":"9738_CR4","doi-asserted-by":"publisher","unstructured":"Arkin, E.M., Bender, M.A., Fekete, S.P., Mitchell, J.S., & Skutella, M. (2006). The freeze-tag problem: how to wake up a swarm of robots. Algorithmica,46, 193\u2013221. https:\/\/doi.org\/10.1007\/s00453-006-1206-1.","DOI":"10.1007\/s00453-006-1206-1"},{"key":"9738_CR5","doi-asserted-by":"publisher","unstructured":"Bruckstein, A.M., Mallows, C.L., & Wagner, I.A. (1997). Probabilistic pursuits on the grid. The American mathematical monthly, 104(4), 323\u2013343. https:\/\/doi.org\/10.1080\/00029890.1997.11990644.","DOI":"10.1080\/00029890.1997.11990644"},{"key":"9738_CR6","doi-asserted-by":"publisher","unstructured":"Gage, D.W. (2001). Minimum-resource distributed navigation and mapping. In: Stein, M.R., Choset, H.M., Gage, D.W., Stein, M.R. (eds.) Mobile Robots XV and Telemanipulator and Telepresence Technologies VII, vol. 4195, pp. 96\u2013103. SPIE, Bellingham, WA. https:\/\/doi.org\/10.1117\/12.417293.","DOI":"10.1117\/12.417293"},{"issue":"5","key":"9738_CR7","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1109\/70.795795","volume":"15","author":"IA Wagner","year":"1999","unstructured":"Wagner, I. A., Lindenbaum, M., & Bruckstein, A. M. (1999). Distributed covering by ant-robots using evaporating traces. IEEE Trans. Robotics Autom., 15(5), 918\u2013933. https:\/\/doi.org\/10.1109\/70.795795","journal-title":"IEEE Trans. Robotics Autom."},{"issue":"1\u20134","key":"9738_CR8","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1018957401093","volume":"24","author":"IA Wagner","year":"1998","unstructured":"Wagner, I. A., Lindenbaum, M., & Bruckstein, A. M. (1998). Efficiently searching a graph by a smell-oriented vertex process. Annals of Mathematics and Artificial Intelligence, 24(1\u20134), 211\u2013223. https:\/\/doi.org\/10.1023\/A:1018957401093","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"9738_CR9","doi-asserted-by":"crossref","unstructured":"Sugihara, K., & Suzuki, I. (1996). Distributed algorithms for formation of geometric patterns with many mobile robots. J. Field Robotics., 13(3), 127\u2013139. https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/(SICI)1097-4563(199603)13:3%3C127::AID-ROB1%3E3.0.CO;2-U","DOI":"10.1002\/(SICI)1097-4563(199603)13:3<127::AID-ROB1>3.0.CO;2-U"},{"issue":"4","key":"9738_CR10","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1137\/S009753979628292X","volume":"28","author":"I Suzuki","year":"1999","unstructured":"Suzuki, I., & Yamashita, M. (1999). Distributed anonymous mobile robots: Formation of geometric patterns. SIAM Journal on Computing, 28(4), 1347\u20131363. https:\/\/doi.org\/10.1137\/S009753979628292X","journal-title":"SIAM Journal on Computing"},{"key":"9738_CR11","doi-asserted-by":"publisher","unstructured":"Arkin, E.M., Bender, M.A., & Ge, D. (2003). Improved approximation algorithms for the freeze-tag problem. In Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures. SPAA \u201903, pp. 295\u2013303. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/777412.777465.","DOI":"10.1145\/777412.777465"},{"issue":"2","key":"9738_CR12","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/S00453-004-1121-2","volume":"41","author":"J K\u00f6nemann","year":"2005","unstructured":"K\u00f6nemann, J., Levin, A., & Sinha, A. (2005). Approximating the degree-bounded minimum diameter spanning tree problem. Algorithmica, 41(2), 117\u2013129. https:\/\/doi.org\/10.1007\/S00453-004-1121-2","journal-title":"Algorithmica"},{"key":"9738_CR13","unstructured":"Abel, Z., Akitaya, H.A., & Yu, J. (2017). Freeze tag awakening in 2d is np-hard. In 27th Fall Workshop on Computational Geometry, pp. 105\u2013107. https:\/\/www.ams.stonybrook.edu\/%7Ejsbm\/fwcg17\/proceedings.pdf."},{"key":"9738_CR14","unstructured":"Johnson, M.P. (2017). Easier hardness for 3d freeze-tag. In 27th Fall Workshop on Computational Geometry, p. 111. https:\/\/www.ams.stonybrook.edu\/%7Ejsbm\/fwcg17\/proceedings.pdf."},{"key":"9738_CR15","doi-asserted-by":"publisher","unstructured":"Pedrosa, L.L.C., & Oliveira Silva, L. (2023). Freeze-tag is np-hard in 3d with l$$_{\\text{1}}$$ distance. In Fernandes, C.G., Rajsbaum, S. (eds.) Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, LAGOS 2023, Huatulco, Mexico, September 18\u201322, 2023. Procedia Computer Science, vol. 223, pp. 360\u2013366. Elsevier, Netherlands (2023). https:\/\/doi.org\/10.1016\/J.PROCS.2023.08.248.","DOI":"10.1016\/J.PROCS.2023.08.248"},{"key":"9738_CR16","doi-asserted-by":"publisher","unstructured":"Bonichon, N., Casteigts, A., Gavoille, C., Hanusse, N.: Freeze-Tag in $$L_1$$ Has Wake-Up Time Five with Linear Complexity. In: Alistarh, D. (ed.) 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), vol. 319, pp. 9\u20131916. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2024). https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2024.9","DOI":"10.4230\/LIPIcs.DISC.2024.9"},{"issue":"6\u20138","key":"9738_CR17","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1016\/J.IPL.2015.02.011","volume":"115","author":"EN Yazdi","year":"2015","unstructured":"Yazdi, E. N., Bagheri, A., Moezkarimi, Z., & Keshavarz, H. (2015). An o(1)-approximation algorithm for the 2-dimensional geometric freeze-tag problem. Information Processing Letters, 115(6\u20138), 618\u2013622. https:\/\/doi.org\/10.1016\/J.IPL.2015.02.011","journal-title":"Information Processing Letters"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-026-09738-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10458-026-09738-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-026-09738-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T07:32:40Z","timestamp":1772263960000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10458-026-09738-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,28]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["9738"],"URL":"https:\/\/doi.org\/10.1007\/s10458-026-09738-8","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,28]]},"assertion":[{"value":"18 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"All authors have read and approved the final manuscript for publication.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"11"}}