{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T22:40:08Z","timestamp":1747867208149,"version":"3.41.0"},"publisher-location":"Cham","reference-count":55,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031917356","type":"print"},{"value":"9783031917363","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-91736-3_16","type":"book-chapter","created":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T22:02:16Z","timestamp":1747864936000},"page":"262-280","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multi-agent Disk Inspection"],"prefix":"10.1007","author":[{"given":"James","family":"Conley","sequence":"first","affiliation":[]},{"given":"Konstantinos","family":"Georgiou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,22]]},"reference":[{"key":"16_CR1","unstructured":"Acharjee, S., Georgiou, K., Kundu, S., Srinivasan, A.: Lower bounds for shoreline searching with 2 or more robots. In: 23rd OPODIS. LIPIcs, vol. 153, pp. 26:1\u201326:11. Schloss Dagstuhl - LZI (2019)"},{"key":"16_CR2","volume-title":"Search Problems","author":"R Ahlswede","year":"1987","unstructured":"Ahlswede, R., Wegener, I.: Search Problems. Wiley, Hoboken (1987)"},{"key":"16_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6825-7","volume-title":"Search Theory","author":"S Alpern","year":"2013","unstructured":"Alpern, S., Fokkink, R., Gasieniec, L., Lindelauf, R., Subrahmanian, V.S.: Search Theory. Springer, Heidelberg (2013)"},{"key":"16_CR4","volume-title":"The Theory of Search Games and Rendezvous","author":"S Alpern","year":"2006","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous, vol. 55. Springer, Heidelberg (2006)"},{"key":"16_CR5","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."},{"key":"16_CR6","first-page":"331","volume":"37","author":"R Baeza-Yates","year":"1997","unstructured":"Baeza-Yates, R.: Searching: an algorithmic tour. Encycl. Comput. Sci. Technol. 37, 331\u2013359 (1997)","journal-title":"Encycl. Comput. Sci. Technol."},{"issue":"3","key":"16_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0925-7721(95)00003-R","volume":"5","author":"R Baeza-Yates","year":"1995","unstructured":"Baeza-Yates, R., Schott, R.: Parallel searching in the plane. Comput. Geom. 5(3), 143\u2013154 (1995)","journal-title":"Comput. Geom."},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Baeza-Yates, R.A., Culberson, J.C., Rawlins, G.J.E.: Searching with uncertainty. In: Scandinavian Workshop on Algorithm Theory, pp. 176\u2013189. Springer (1988)","DOI":"10.1007\/3-540-19487-8_20"},{"issue":"2","key":"16_CR9","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1993.1054","volume":"106","author":"RA Baezayates","year":"1993","unstructured":"Baezayates, R.A., Culberson, J.C., Rawlins, G.: Searching in the plane. Inf. Comput. 106(2), 234\u2013252 (1993)","journal-title":"Inf. Comput."},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Bagheri, I., Narayanan, L., Opatrny, J.: Evacuation of equilateral triangles by mobile agents of limited communication range. In: Dressler, F., Scheideler, C. (eds.) ALGOSENSORS 2019. LNCS, vol. 11931, pp. 3\u201322. Springer (2019)","DOI":"10.1007\/978-3-030-34405-4_1"},{"issue":"1","key":"16_CR11","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s00453-018-0447-0","volume":"81","author":"E Bampas","year":"2019","unstructured":"Bampas, E., et al.: Linear search by a pair of distinct-speed robots. Algorithmica 81(1), 317\u2013342 (2019)","journal-title":"Algorithmica"},{"issue":"4","key":"16_CR12","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)","journal-title":"Israel J. Math."},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Behrouz, P., Konstantinidis, O., Leonardos, N., Pagourtzis, A., Papaioannou, I., Spyrakou, M.: Byzantine fault-tolerant protocols for (n, f)-evacuation from a circle. In: International Symposium on Algorithmics of Wireless Networks, pp. 87\u2013100. Springer (2023)","DOI":"10.1007\/978-3-031-48882-5_7"},{"issue":"3","key":"16_CR14","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1090\/S0002-9904-1956-10021-9","volume":"62","author":"R Bellman","year":"1956","unstructured":"Bellman, R.: Minimization problem. Bull. Amer. Math. Soc 62(3), 270 (1956)","journal-title":"Bull. Amer. Math. Soc"},{"key":"16_CR15","unstructured":"Bellman, R.: Dynamic Programming. Chapter IX. Princeton University Press, Princeton (1958)"},{"issue":"3","key":"16_CR16","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 (1963)","journal-title":"SIAM Rev."},{"key":"16_CR17","unstructured":"Berzsenyi, G.: Lost in a forest (a problem area initiated by the late Richard E. Bellman). Quantum 41 (1995)"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Bonato, A., Georgiou, K., MacRury, C., Pra\u0142at, P.: Algorithms for p-faulty search on a half-line. Algorithmica 1\u201330 (2022)","DOI":"10.1007\/s00453-022-01075-y"},{"key":"16_CR19","unstructured":"Bouchard, S., Dieudonn\u00e9, Y., Pelc, A., Petit, F.: Deterministic treasure hunt in the plane with angular hints. In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, vol. 123, pp. 48\u20131. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik (2018)"},{"key":"16_CR20","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. Theor. Comput. Sci. 811, 56\u201369 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Chrobak, M., Gasieniec, 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. LNCS, vol. 8939, pp. 164\u2013176. Springer (2015)","DOI":"10.1007\/978-3-662-46078-8_14"},{"issue":"11","key":"16_CR22","doi-asserted-by":"publisher","first-page":"506","DOI":"10.3390\/info11110506","volume":"11","author":"H Chuangpishit","year":"2020","unstructured":"Chuangpishit, H., Georgiou, K., Sharma, P.: A multi-objective optimization problem on evacuating 2 robots from the disk in the face-to-face model; trade-offs between worst-case and average-case analysis. Information 11(11), 506 (2020)","journal-title":"Information"},{"key":"16_CR23","unstructured":"Conley, J., Georgiou, K.: Multi-agent disk inspection. arXiv preprint arXiv:2411.15391 (2024)"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Gasieniec, L., Gorry, T., Kranakis, E., Martin, R., Pajak, D.: Evacuating robots via unknown exit in a disk. In: Kuhn, F. (eds.) DISC 2014. LNCS, vol. 8784, pp. 122\u2013136. Springer (2014)","DOI":"10.1007\/978-3-662-45174-8_9"},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., et al.: Evacuation from a disc in the presence of a faulty robot. In: Das, S., Tixeuil, S. (eds.) SIROCCO 2017. LNCS, vol. 10641, pp. 158\u2013173. Springer (2017)","DOI":"10.1007\/978-3-319-72050-0_10"},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Georgiou, K., Kranakis, E.: Group search and evacuation. In: Flocchini, P., Prencipe, G., Santoro, N. (eds.) Distributed Computing by Mobile Entities; Current Research in Moving and Computing, chap.\u00a014, pp. 335\u2013370. Springer (2019)","DOI":"10.1007\/978-3-030-11072-7_14"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Kranakis, E., Krizanc, D., Narayanan, L., Opatrny, J., Shende, S.M.: Wireless autonomous robot evacuation from equilateral triangles and squares. In: Papavassiliou, S., Ruehrup, S. (eds.) 14th International Conference, ADHOC-NOW. LNCS, vol. 9143, pp. 181\u2013194. Springer (2015)","DOI":"10.1007\/978-3-319-19662-6_13"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Kranakis, E., Krizanc, D., Narayanan, L., Opatrny, J., Shende, S.M.: Linear search with terrain-dependent speeds. In: Fotakis, D., Pagourtzis, A., Paschos, V.T. (eds.) CIAC 2017. LNCS, vol. 10236, pp. 430\u2013441 (2017)","DOI":"10.1007\/978-3-319-57586-5_36"},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"Dobrev, S., Kr\u00e1lovi\u010d, R., Pardubsk\u00e1, D.: Improved lower bounds for shoreline search. In: International Colloquium on Structural Information and Communication Complexity, pp. 80\u201390. Springer (2020)","DOI":"10.1007\/978-3-030-54921-3_5"},{"key":"16_CR30","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.tcs.2015.05.054","volume":"608","author":"Y Emek","year":"2015","unstructured":"Emek, Y., Langner, T., Stolz, D., Uitto, J., Wattenhofer, R.: How many ants does it take to find the food? Theoret. Comput. Sci. 608, 255\u2013267 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR31","doi-asserted-by":"crossref","unstructured":"Emek, Y., Langner, T., Uitto, J., Wattenhofer, R.: Solving the ants problem with asynchronous finite state machines. In: Proceedings of International Colloquium on Automata, Languages, and Programming (ICALP). LNCS, vol. 8573, pp. 471\u2013482 (2014)","DOI":"10.1007\/978-3-662-43951-7_40"},{"key":"16_CR32","doi-asserted-by":"crossref","unstructured":"Fekete, S.P., Gray, C., Kr\u00f6ller, A.: Evacuation of rectilinear polygons. In: Wu, W., Daescu, O. (eds.) COCOA 2010, Part I. LNCS, vol. 6508, pp. 21\u201330. Springer (2010)","DOI":"10.1007\/978-3-642-17458-2_3"},{"issue":"8","key":"16_CR33","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1080\/00029890.2004.11920126","volume":"111","author":"SR Finch","year":"2004","unstructured":"Finch, S.R., Wetzel, J.E.: Lost in a forest. Am. Math. Mon. 111(8), 645\u2013654 (2004)","journal-title":"Am. Math. Mon."},{"key":"16_CR34","unstructured":"Finch, S.R., Zhu, L.-Y.: Searching for a shoreline. arXiv preprint math\/0501123 (2005)"},{"key":"16_CR35","doi-asserted-by":"crossref","unstructured":"Fricke, G.M., Hecker, J.P., Griego, A.D., Tran, L.T., Moses, M.E.: A distributed deterministic spiral search algorithm for swarms. In: 2016 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 4430\u20134436. IEEE (2016)","DOI":"10.1109\/IROS.2016.7759652"},{"key":"16_CR36","doi-asserted-by":"crossref","unstructured":"Gal, S.: Search Games. Wiley Encyclopedia of Operations Research and Management Science (2010)","DOI":"10.1002\/9780470400531.eorms0912"},{"key":"16_CR37","doi-asserted-by":"crossref","unstructured":"Georgiou, K., Jang, W.: Triangle evacuation of 2 agents in the wireless model. In: Algorithmics of Wireless Networks: 18th International Symposium on Algorithmics of Wireless Networks, ALGOSENSORS 2022, Potsdam, Germany, 8\u20139 September 2022, pp. 77\u201390. Springer (2022)","DOI":"10.1007\/978-3-031-22050-0_6"},{"key":"16_CR38","doi-asserted-by":"crossref","unstructured":"Georgiou, K., Jones, C., Lucier, J.: Multi-agent search-type problems on polygons. In: International Conference on Current Trends in Theory and Practice of Computer Science, pp. 314\u2013332. Springer (2025)","DOI":"10.1007\/978-3-031-82670-2_23"},{"key":"16_CR39","doi-asserted-by":"publisher","first-page":"113675","DOI":"10.1016\/j.tcs.2022.12.025","volume":"944","author":"K Georgiou","year":"2023","unstructured":"Georgiou, K., Leizerovich, S., Lucier, J., Kundu, S.: Evacuating from $$\\ell _p$$ unit disks in the wireless model. Theoret. Comput. Sci. 944, 113675 (2023)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2022.10.013","volume":"939","author":"K Georgiou","year":"2023","unstructured":"Georgiou, K., Lucier, J.: Weighted group search on a line & implications to the priority evacuation problem. Theoret. Comput. Sci. 939, 1\u201317 (2023)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR41","unstructured":"Gibbs, P.: Bellman\u2019s escape problem for convex polygons (2016)"},{"issue":"1","key":"16_CR42","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1002\/nav.3800080108","volume":"8","author":"B Gluss","year":"1961","unstructured":"Gluss, B.: An alternative solution to the \u201clost at sea\u2019\u2019 problem. Naval Res. Logist. Q. 8(1), 117\u2013122 (1961)","journal-title":"Naval Res. Logist. Q."},{"issue":"4","key":"16_CR43","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1002\/nav.3800080404","volume":"8","author":"B Gluss","year":"1961","unstructured":"Gluss, B.: The minimax path in a search for a circle in a plane. Naval Res. Logist. Q. 8(4), 357\u2013360 (1961)","journal-title":"Naval Res. Logist. Q."},{"issue":"4","key":"16_CR44","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1002\/nav.3800040409","volume":"4","author":"JR Isbell","year":"1957","unstructured":"Isbell, J.R.: An optimal search pattern. Naval Res. Logist. Q. 4(4), 357\u2013359 (1957)","journal-title":"Naval Res. Logist. Q."},{"issue":"11","key":"16_CR45","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1016\/j.ipl.2009.01.020","volume":"109","author":"A Je\u017c","year":"2009","unstructured":"Je\u017c, A., \u0141opusza\u0144ski, J.: On the two-dimensional cow search problem. Inf. Process. Lett. 109(11), 543\u2013547 (2009)","journal-title":"Inf. Process. Lett."},{"key":"16_CR46","unstructured":"Kleinberg, J.M.: On-line search in a simple polygon. In: SODA, vol.\u00a094, pp. 8\u201315. Citeseer (1994)"},{"key":"16_CR47","doi-asserted-by":"publisher","first-page":"101709","DOI":"10.1016\/j.comgeo.2020.101709","volume":"93","author":"D K\u00fcbel","year":"2021","unstructured":"K\u00fcbel, D., Langetepe, E.: On the approximation of shortest escape paths. Comput. Geom. 93, 101709 (2021)","journal-title":"Comput. Geom."},{"key":"16_CR48","doi-asserted-by":"crossref","unstructured":"Langetepe, E.: On the optimality of spiral search. In: Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms, pp. 1\u201312. SIAM (2010)","DOI":"10.1137\/1.9781611973075.1"},{"key":"16_CR49","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.tcs.2011.12.069","volume":"447","author":"E Langetepe","year":"2012","unstructured":"Langetepe, E.: Searching for an axis-parallel shoreline. Theoret. Comput. Sci. 447, 85\u201399 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR50","unstructured":"Langner, T., Keller, B., Uitto, J., Wattenhofer, R.: Overcoming obstacles with ants. In: Anceaume, E., Cachin, C., Potop-Butucaru, M.G. (eds.) International Conference on Principles of Distributed Systems (OPODIS). LIPIcs, vol. 46, pp. 9:1\u20139:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015)"},{"key":"16_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: Proceedings of the 19th International Conference on Distributed Computing and Networking, pp. 1\u20134 (2018)","DOI":"10.1145\/3154273.3154313"},{"key":"16_CR52","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.ipl.2018.04.006","volume":"140","author":"A Pelc","year":"2018","unstructured":"Pelc, A.: Reaching a target in the plane with no information. Inf. Process. Lett. 140, 13\u201317 (2018)","journal-title":"Inf. Process. Lett."},{"key":"16_CR53","unstructured":"Pelc, A., Yadav, R.N.: Information complexity of treasure hunt in geometric terrains. arXiv preprint arXiv:1811.06823 (2018)"},{"key":"16_CR54","unstructured":"Pelc, A., Yadav, R.N.: Cost vs. information tradeoffs for treasure hunt in the plane. arXiv preprint arXiv:1902.06090 (2019)"},{"key":"16_CR55","unstructured":"Shklarsky, D.O., Chentzov, N.N., Yaglom, I.M.: The USSR Olympiad Problem Book: Selected Problems and Theorems of Elementary Mathematics, Part 2, vol. II. Nauka Publishers, Moscow (1962)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91736-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T22:02:37Z","timestamp":1747864957000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91736-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031917356","9783031917363"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91736-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"22 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Delphi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.torontomu.ca\/sirocco-2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}