{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:07:11Z","timestamp":1743066431415,"version":"3.40.3"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030892395"},{"type":"electronic","value":"9783030892401"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-89240-1_6","type":"book-chapter","created":{"date-parts":[[2021,10,19]],"date-time":"2021-10-19T05:01:04Z","timestamp":1634619664000},"page":"76-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Evacuating from $$\\ell _p$$ Unit Disks in the Wireless Model"],"prefix":"10.1007","author":[{"given":"Konstantinos","family":"Georgiou","sequence":"first","affiliation":[]},{"given":"Sean","family":"Leizerovich","sequence":"additional","affiliation":[]},{"given":"Jesse","family":"Lucier","sequence":"additional","affiliation":[]},{"given":"Somnath","family":"Kundu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,19]]},"reference":[{"key":"6_CR1","unstructured":"Acharjee, S., Georgiou, K., Kundu, S., Srinivasan, A.: Lower bounds for shoreline searching with 2 or more robots. In: 23rd OPODIS, volume 153 of LIPIcs, pp. 26:1\u201326:11. Schloss Dagstuhl - LZI (2019)"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Adler, C.L., Tanton, J.: $$\\pi $$ is the minimum value of Pi. CMJ: Coll. Math. J. 31, 102-106 (2000)","DOI":"10.1080\/07468342.2000.11974122"},{"key":"6_CR3","volume-title":"Search Problems","author":"R Ahlswede","year":"1987","unstructured":"Ahlswede, R., Wegener, I.: Search Problems. Wiley-Interscience, Hoboken (1987)"},{"issue":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s00453-001-0067-x","volume":"32","author":"S Albers","year":"2002","unstructured":"Albers, S., Kursawe, K., Schuierer, S.: Exploring unknown environments with obstacles. Algorithmica 32(1), 123\u2013143 (2002). https:\/\/doi.org\/10.1007\/s00453-001-0067-x","journal-title":"Algorithmica"},{"key":"6_CR5","volume-title":"The Theory of Search Games and Rendezvous","author":"S Alpern","year":"2002","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous, vol. 55. Kluwer Academic Publishers, Heidelberg (2002)"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-1-4614-6825-7_14","volume-title":"Search Theory","author":"S Alpern","year":"2013","unstructured":"Alpern, S.: Ten open problems in rendezvous search. In: Alpern, S., Fokkink, R., G\u0105sieniec, L., Lindelauf, R., Subrahmanian, V. (eds.) Search Theory, pp. 223\u2013230. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-6825-7_14"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.dam.2019.01.039","volume":"260","author":"S Angelopoulos","year":"2019","unstructured":"Angelopoulos, S., D\u00fcrr, C., Lidbetter, T.: The expanding search ratio of a graph. Discret. Appl. Math. 260, 51\u201365 (2019)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"6_CR8","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1993.1054","volume":"106","author":"R Baeza Yates","year":"1993","unstructured":"Baeza Yates, R., Culberson, J., Rawlins, G.: Searching in the plane. Inf. Comput. 106(2), 234\u2013252 (1993)","journal-title":"Inf. Comput."},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4614-6825-7_6","volume-title":"Search Theory","author":"V Baston","year":"2013","unstructured":"Baston, V.: Some Cinderella Ruckle type games. In: Alpern, S., Fokkink, R., G\u0105sieniec, L., Lindelauf, R., Subrahmanian, V. (eds.) Search Theory, pp. 85\u2013103. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-6825-7_6"},{"issue":"2","key":"6_CR10","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1287\/moor.1090.0382","volume":"34","author":"N Baumann","year":"2009","unstructured":"Baumann, N., Skutella, M.: Earliest arrival flows with multiple sources. Math. Oper. Res. 34(2), 499\u2013512 (2009)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"6_CR11","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/BF02759737","volume":"2","author":"A Beck","year":"1964","unstructured":"Beck, A.: On the linear search problem. Israel J. Math. 2(4), 221\u2013228 (1964). https:\/\/doi.org\/10.1007\/BF02759737","journal-title":"Israel J. Math."},{"issue":"3","key":"6_CR12","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1137\/1005070","volume":"5","author":"R Bellman","year":"1963","unstructured":"Bellman, R.: An optimal search. SIAM Rev. 5(3), 274\u2013274 (1963)","journal-title":"SIAM Rev."},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Bonato, A., Georgiou, K., MacRury, C., Pralat, P.: Probabilistically faulty searching on a half-line. In: 14th LATIN (2020, to appear)","DOI":"10.1007\/978-3-030-61792-9_14"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-319-48314-6_15","volume-title":"Structural Information and Communication Complexity","author":"P Borowiecki","year":"2016","unstructured":"Borowiecki, P., Das, S., Dereniowski, D., Kuszner, \u0141: Distributed evacuation in graphs with multiple exits. In: Suomela, J. (ed.) SIROCCO 2016. LNCS, vol. 9988, pp. 228\u2013241. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48314-6_15"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-319-57586-5_10","volume-title":"Algorithms and Complexity","author":"S Brandt","year":"2017","unstructured":"Brandt, S., Laufenberg, F., Lv, Y., Stolz, D., Wattenhofer, R.: Collaboration without communication: evacuating two robots from a disk. In: Fotakis, D., Pagourtzis, A., Paschos, V.T. (eds.) CIAC 2017. LNCS, vol. 10236, pp. 104\u2013115. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57586-5_10"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.tcs.2018.10.032","volume":"811","author":"S Brandt","year":"2020","unstructured":"Brandt, S., Foerster, K.-T., Richner, B., Wattenhofer, R.: Wireless evacuation on m rays with k searchers. Theoret. Comput. Sci. 811, 56\u201369 (2020)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"6_CR17","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez, E., Navarro, G., Baeza-Yates, R., Marroqu\u00edn, J.L.: Searching in metric spaces. ACM Comput. Surv. (CSUR) 33(3), 273\u2013321 (2001)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-662-46078-8_14","volume-title":"SOFSEM 2015: Theory and Practice of Computer Science","author":"M Chrobak","year":"2015","unstructured":"Chrobak, M., G\u0105sieniec, L., Gorry, T., Martin, R.: Group search on the line. In: Italiano, G.F., Margaria-Steffen, T., Pokorn\u00fd, J., Quisquater, J.-J., Wattenhofer, R. (eds.) SOFSEM 2015. LNCS, vol. 8939, pp. 164\u2013176. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46078-8_14"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-030-14094-6_5","volume-title":"Algorithms for Sensor Systems","author":"H Chuangpishit","year":"2019","unstructured":"Chuangpishit, H., Georgiou, K., Sharma, P.: Average case - worst case tradeoffs for evacuating 2 robots from the disk in the face-to-face model. In: Gilbert, S., Hughes, D., Krishnamachari, B. (eds.) ALGOSENSORS 2018. LNCS, vol. 11410, pp. 62\u201382. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-14094-6_5"},{"key":"6_CR20","doi-asserted-by":"publisher","unstructured":"Chuangpishit, H., Mehrabi, S., Narayanan, L., Opatrny, J.: Evacuating equilateral triangles and squares in the face-to-face model. Comput. Geom. 89, 101624 (2020). https:\/\/doi.org\/10.1016\/j.comgeo.2020.101624","DOI":"10.1016\/j.comgeo.2020.101624"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-662-45174-8_9","volume-title":"Distributed Computing","author":"J Czyzowicz","year":"2014","unstructured":"Czyzowicz, J., G\u0105sieniec, L., Gorry, T., Kranakis, E., Martin, R., Pajak, D.: Evacuating robots via unknown exit in a disk. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol. 8784, pp. 122\u2013136. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45174-8_9"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-319-72050-0_10","volume-title":"Structural Information and Communication Complexity","author":"J Czyzowicz","year":"2017","unstructured":"Czyzowicz, J., et al.: Evacuation from a disc in the presence of\u00a0a\u00a0faulty robot. In: Das, S., Tixeuil, S. (eds.) SIROCCO 2017. LNCS, vol. 10641, pp. 158\u2013173. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-72050-0_10"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/978-3-030-01325-7_32","volume-title":"Structural Information and Communication Complexity","author":"J Czyzowicz","year":"2018","unstructured":"Czyzowicz, J., et al.: Priority evacuation from a disk using mobile robots. In: Lotker, Z., Patt-Shamir, B. (eds.) SIROCCO 2018. LNCS, vol. 11085, pp. 392\u2013407. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01325-7_32"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-030-11072-7_14","volume-title":"Distributed Computing by Mobile Entities","author":"J Czyzowicz","year":"2019","unstructured":"Czyzowicz, J., Georgiou, K., Kranakis, E.: Group search and evacuation. In: Flocchini, P., Prencipe, G., Santoro, N. (eds.) Distributed Computing by Mobile Entities. Lecture Notes in Computer Science, vol. 11340, pp. 335\u2013370. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11072-7_14"},{"key":"6_CR25","doi-asserted-by":"publisher","unstructured":"Czyzowicz, J., Georgiou, K., Kranakis, E., Narayanan, L., Opatrny, J., Vogtenhuber, B.: Evacuating robots from a disk using face-to-face communication. Discrete Math. Theoret. Comput. Sci. 22(4) (2020). https:\/\/doi.org\/10.23638\/DMTCS-22-4-4","DOI":"10.23638\/DMTCS-22-4-4"},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-319-57586-5_36","volume-title":"Algorithms and Complexity","author":"J Czyzowicz","year":"2017","unstructured":"Czyzowicz, J., Kranakis, E., Krizanc, D., Narayanan, L., Opatrny, J., Shende, S.: Linear search with terrain-dependent speeds. In: Fotakis, D., Pagourtzis, A., Paschos, V.T. (eds.) CIAC 2017. LNCS, vol. 10236, pp. 430\u2013441. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57586-5_36"},{"key":"6_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-319-19662-6_13","volume-title":"Ad-hoc, Mobile, and Wireless Networks","author":"J Czyzowicz","year":"2015","unstructured":"Czyzowicz, J., Kranakis, E., Krizanc, D., Narayanan, L., Opatrny, J., Shende, S.: Wireless autonomous robot evacuation from equilateral triangles and squares. In: Papavassiliou, S., Ruehrup, S. (eds.) ADHOC-NOW 2015. LNCS, vol. 9143, pp. 181\u2013194. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19662-6_13"},{"key":"6_CR28","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.tcs.2016.11.019","volume":"709","author":"J Czyzowicz","year":"2018","unstructured":"Czyzowicz, J., Dobrev, S., Georgiou, K., Kranakis, E., MacQuarrie, F.: Evacuating two robots from multiple unknown exits in a circle. Theoret. Comput. Sci. 709, 20\u201330 (2018)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR29","unstructured":"Czyzowicz, J., et al.: Energy consumption of group search on a line. In: 46th ICALP, volume 132 of LIPIcs, Dagstuhl, Germany, pp. 137:1\u2013137:15. Schloss Dagstuhl-LZI (2019)"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., et al.: Priority evacuation from a disk: the case of n =1, 2, 3, vol. 806, pp. 595\u2013616 (2020)","DOI":"10.1016\/j.tcs.2019.09.026"},{"issue":"2","key":"6_CR31","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.tcs.2006.05.018","volume":"361","author":"ED Demaine","year":"2006","unstructured":"Demaine, E.D., Fekete, S.P., Gal, S.: Online searching with turn cost. Theoret. Comput. Sci. 361(2), 342\u2013355 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-030-24922-9_14","volume-title":"Structural Information and Communication Complexity","author":"Y Disser","year":"2019","unstructured":"Disser, Y., Schmitt, S.: Evacuating two robots from a disk: a second cut. In: Censor-Hillel, K., Flammini, M. (eds.) SIROCCO 2019. LNCS, vol. 11639, pp. 200\u2013214. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24922-9_14"},{"key":"6_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-030-54921-3_5","volume-title":"Structural Information and Communication Complexity","author":"S Dobrev","year":"2020","unstructured":"Dobrev, S., Kr\u00e1lovi\u010d, R., Pardubsk\u00e1, D.: Improved lower bounds for shoreline search. In: Richa, A.W., Scheideler, C. (eds.) SIROCCO 2020. LNCS, vol. 12156, pp. 80\u201390. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-54921-3_5"},{"key":"6_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-662-43951-7_40","volume-title":"Automata, Languages, and Programming","author":"Y Emek","year":"2014","unstructured":"Emek, Y., Langner, T., Uitto, J., Wattenhofer, R.: Solving the ANTS problem with asynchronous finite state machines. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8573, pp. 471\u2013482. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43951-7_40"},{"key":"6_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-17458-2_3","volume-title":"Combinatorial Optimization and Applications","author":"S Fekete","year":"2010","unstructured":"Fekete, S., Gray, C., Kr\u00f6ller, A.: Evacuation of rectilinear polygons. In: Wu, W., Daescu, O. (eds.) COCOA 2010. LNCS, vol. 6508, pp. 21\u201330. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17458-2_3"},{"key":"6_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-319-53058-1_6","volume-title":"Algorithms for Sensor Systems","author":"K Georgiou","year":"2017","unstructured":"Georgiou, K., Karakostas, G., Kranakis, E.: Search-and-fetch with one robot on a disk. In: Chrobak, M., Fern\u00e1ndez Anta, A., G\u0105sieniec, L., Klasing, R. (eds.) ALGOSENSORS 2016. LNCS, vol. 10050, pp. 80\u201394. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-53058-1_6"},{"key":"6_CR37","doi-asserted-by":"crossref","unstructured":"Georgiou, K., Leizerovich, S., Lucier, J., Kundu, S.: Evacuating from $$\\ell _p$$ unit disks in the wireless model. CoRR, abs\/2108.02367 (2021)","DOI":"10.1016\/j.tcs.2022.12.025"},{"key":"6_CR38","doi-asserted-by":"publisher","unstructured":"Georgiou, K., Karakostas, G., Kranakis, E.: Search-and-fetch with 2 robots on a disk: wireless and face-to-face communication models. Discrete Math. Theoret. Comput. Sci. 21(3) (2019). https:\/\/doi.org\/10.23638\/DMTCS-21-3-20","DOI":"10.23638\/DMTCS-21-3-20"},{"key":"6_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-030-34405-4_11","volume-title":"Algorithms for Sensor Systems","author":"K Georgiou","year":"2019","unstructured":"Georgiou, K., Kranakis, E., Leonardos, N., Pagourtzis, A., Papaioannou, I.: Optimal circle search despite the presence of faulty robots. In: Dressler, F., Scheideler, C. (eds.) ALGOSENSORS 2019. LNCS, vol. 11931, pp. 192\u2013205. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34405-4_11"},{"key":"6_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-030-62401-9_9","volume-title":"Algorithms for Sensor Systems","author":"K Georgiou","year":"2020","unstructured":"Georgiou, K., Lucier, J.: Weighted group search on a line. In: Pinotti, C.M., Navarra, A., Bagchi, A. (eds.) ALGOSENSORS 2020. LNCS, vol. 12503, pp. 124\u2013139. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-62401-9_9"},{"key":"6_CR41","first-page":"559","volume":"25","author":"K Georgiou","year":"2017","unstructured":"Georgiou, K., Kranakis, E., Steau, A.: Searching with advice: robot fence-jumping. J. Inf. Process. 25, 559\u2013571 (2017)","journal-title":"J. Inf. Process."},{"issue":"1","key":"6_CR42","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1006\/inco.1996.0092","volume":"131","author":"M-Y Kao","year":"1996","unstructured":"Kao, M.-Y., Reif, J.H., Tate, S.R.: Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem. Inf. Comput. 131(1), 63\u201379 (1996)","journal-title":"Inf. Comput."},{"issue":"10","key":"6_CR43","doi-asserted-by":"publisher","first-page":"931","DOI":"10.4169\/000298909X477069","volume":"116","author":"JB Keller","year":"2009","unstructured":"Keller, J.B., Vakil, R.: $$ \\pi _p $$, the value of $$ \\pi $$ in $$ \\ell _p $$. Amer. Math. Monthly 116(10), 931\u2013935 (2009)","journal-title":"Amer. Math. Monthly"},{"key":"6_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-030-24922-9_13","volume-title":"Structural Information and Communication Complexity","author":"J Czyzowicz","year":"2019","unstructured":"Czyzowicz, J., et al.: Time-energy tradeoffs for evacuation by two robots in the wireless model. In: Censor-Hillel, K., Flammini, M. (eds.) SIROCCO 2019. LNCS, vol. 11639, pp. 185\u2013199. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24922-9_13"},{"key":"6_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-662-53426-7_1","volume-title":"Distributed Computing","author":"I Lamprou","year":"2016","unstructured":"Lamprou, I., Martin, R., Schewe, S.: Fast two-robot disk evacuation with wireless communication. In: Gavoille, C., Ilcinkas, D. (eds.) DISC 2016. LNCS, vol. 9888, pp. 1\u201315. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53426-7_1"},{"key":"6_CR46","doi-asserted-by":"crossref","unstructured":"Lenzen, C., Lynch, N., Newport, C., Radeva, T.: Trade-offs between selection complexity and performance when searching the plane without communication. In: PODC, pp. 252\u2013261. ACM (2014)","DOI":"10.1145\/2611462.2611463"},{"key":"6_CR47","unstructured":"L\u00f3pez-Ortiz, A., Sweet, G.: Parallel searching on a lattice. In: CCCG, pp. 125\u2013128 (2001)"},{"key":"6_CR48","doi-asserted-by":"crossref","unstructured":"Mitchell, J.S.B.: Geometric shortest paths and network optimization. In: Handbook of Computational Geometry, vol. 334, pp. 633\u2013702 (2000)","DOI":"10.1016\/B978-044482537-7\/50016-4"},{"key":"6_CR49","doi-asserted-by":"publisher","DOI":"10.1515\/9781400842063","volume-title":"Chases and Escapes: The Mathematics of Pursuit and Evasion","author":"P Nahin","year":"2012","unstructured":"Nahin, P.: Chases and Escapes: The Mathematics of Pursuit and Evasion. Princeton University Press, Princeton (2012)"},{"key":"6_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-030-34405-4_10","volume-title":"Algorithms for Sensor Systems","author":"D Pattanayak","year":"2019","unstructured":"Pattanayak, D., Ramesh, H., Mandal, P.S.: Chauffeuring a crashed robot from a disk. In: Dressler, F., Scheideler, C. (eds.) ALGOSENSORS 2019. LNCS, vol. 11931, pp. 177\u2013191. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34405-4_10"},{"key":"6_CR51","doi-asserted-by":"crossref","unstructured":"Pattanayak, D., Ramesh, H, Mandal, P.S., Schmid, S.: Evacuating two robots from two unknown exits on the perimeter of a disk with wireless communication. In: 19th ICDCN, pp. 20:1\u201320:4. ACM (2018)","DOI":"10.1145\/3154273.3154313"},{"issue":"2","key":"6_CR52","doi-asserted-by":"publisher","first-page":"1187","DOI":"10.1016\/j.jmaa.2007.03.047","volume":"336","author":"W-D Richter","year":"2007","unstructured":"Richter, W.-D.: Generalized spherical and simplicial coordinates. J. Math. Anal. Appl. 336(2), 1187\u20131202 (2007)","journal-title":"J. Math. Anal. Appl."},{"key":"6_CR53","volume-title":"Theory of Optimal Search","author":"L Stone","year":"1975","unstructured":"Stone, L.: Theory of Optimal Search. Academic Press, New York (1975)"}],"container-title":["Lecture Notes in Computer Science","Algorithms for Sensor Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89240-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T19:31:56Z","timestamp":1673551916000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89240-1_6"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030892395","9783030892401"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89240-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"19 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ALGOSENSORS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algosensors2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo2021.tecnico.ulisboa.pt\/ALGOSENSORS2021\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held online due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}