{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:36:19Z","timestamp":1743032179461,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031327322"},{"type":"electronic","value":"9783031327339"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-32733-9_13","type":"book-chapter","created":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T23:04:40Z","timestamp":1684969480000},"page":"297-316","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Search and Rescue on the Line"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1227-2962","authenticated-orcid":false,"given":"Jared","family":"Coleman","sequence":"first","affiliation":[]},{"given":"Lorand","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Bhaskar","family":"Krishnamachari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,25]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-662-55751-8_8","volume-title":"Fundamentals of Computation Theory","author":"A B\u00e4rtschi","year":"2017","unstructured":"B\u00e4rtschi, A., Tschager, T.: Energy-efficient fast delivery by mobile agents. In: Klasing, R., Zeitoun, M. (eds.) FCT 2017. LNCS, vol. 10472, pp. 82\u201395. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-55751-8_8"},{"issue":"4","key":"13_CR2","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":"13_CR3","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":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-40450-4_18","volume-title":"Algorithms \u2013 ESA 2013","author":"P Bose","year":"2013","unstructured":"Bose, P., De Carufel, J.-L., Durocher, S.: Revisiting the problem of searching on a line. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 205\u2013216. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40450-4_18"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.jcss.2020.09.002","volume":"115","author":"IA Carvalho","year":"2021","unstructured":"Carvalho, I.A., Erlebach, T., Papadopoulos, K.: On the fast delivery problem with one or two packages. J. Comput. Syst. Sci. 115, 246\u2013263 (2021). https:\/\/doi.org\/10.1016\/j.jcss.2020.09.002","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"13_CR6","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1145\/1620491.1620500","volume":"40","author":"E Cenek","year":"2009","unstructured":"Cenek, E.: Chases and escapes by Paul J. Nahin. ACM SIGACT News 40(3), 48\u201350 (2009). https:\/\/doi.org\/10.1145\/1620491.1620500","journal-title":"ACM SIGACT News"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-662-43951-7_36","volume-title":"Automata, Languages, and Programming","author":"J Chalopin","year":"2014","unstructured":"Chalopin, J., Jacob, R., Mihal\u00e1k, M., Widmayer, P.: Data delivery by energy-constrained mobile agents on a line. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8573, pp. 423\u2013434. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43951-7_36"},{"key":"13_CR8","doi-asserted-by":"publisher","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 2015. LNCS, vol. 8939, pp. 164\u2013176. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46078-8_14","DOI":"10.1007\/978-3-662-46078-8_14"},{"issue":"2","key":"13_CR9","doi-asserted-by":"publisher","first-page":"2091","DOI":"10.1109\/LRA.2021.3061304","volume":"6","author":"L Clark","year":"2021","unstructured":"Clark, L., Galante, J., Krishnamachari, B., Psounis, K.: A queue-stabilizing framework for networked multi-robot exploration. IEEE Robot. Autom. Lett. 6(2), 2091\u20132098 (2021). https:\/\/doi.org\/10.1109\/LRA.2021.3061304","journal-title":"IEEE Robot. Autom. Lett."},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-030-91081-5_20","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"J Coleman","year":"2021","unstructured":"Coleman, J., Kranakis, E., Krizanc, D., Ponce, O.M.: Message delivery in the plane by robots with different speeds. In: Johnen, C., Schiller, E.M., Schmid, S. (eds.) SSS 2021. LNCS, vol. 13046, pp. 305\u2013319. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-91081-5_20"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-030-79987-8_15","volume-title":"Combinatorial Algorithms","author":"J Coleman","year":"2021","unstructured":"Coleman, J., Kranakis, E., Krizanc, D., Morales-Ponce, O.: The pony express communication problem. In: Flocchini, P., Moura, L. (eds.) IWOCA 2021. LNCS, vol. 12757, pp. 208\u2013222. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79987-8_15"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Coleman, J., Kranakis, E., Krizanc, D., Morales-Ponce, O.: Delivery to safety with two cooperating robots. CoRR abs\/2210.04080 (2022). https:\/\/doi.org\/10.48550\/arXiv.2210.04080","DOI":"10.48550\/arXiv.2210.04080"},{"key":"13_CR13","doi-asserted-by":"publisher","unstructured":"Coleman, J., Kranakis, E., Krizanc, D., Morales-Ponce, O.: Line search for an oblivious moving target. CoRR abs\/2211.03686 (2022). https:\/\/doi.org\/10.48550\/arXiv.2211.03686","DOI":"10.48550\/arXiv.2211.03686"},{"issue":"1","key":"13_CR14","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF02124750","volume":"5","author":"RM Corless","year":"1996","unstructured":"Corless, R.M., Gonnet, G.H., Hare, D.E.G., Jeffrey, D.J., Knuth, D.E.: On the lambertW function. Adv. Comput. Math. 5(1), 329\u2013359 (1996). https:\/\/doi.org\/10.1007\/BF02124750","journal-title":"Adv. Comput. Math."},{"key":"13_CR15","unstructured":"Czyzowicz, J., Georgiou, K., Kranakis, E., Narayanan, L., Opatrny, J., Vogtenhuber, B.: Evacuating robots from a disk using face-to-face communication. Discret. Math. Theor. Comput. Sci. 22(4) (2020). http:\/\/dmtcs.episciences.org\/6732"},{"key":"13_CR16","doi-asserted-by":"publisher","unstructured":"Czyzowicz, J., Georgiou, K., Kranakis, E.: Group search and evacuation. In: Flocchini, P., Prencipe, G., Santoro, N. (eds.) Distributed Computing by Mobile Entities. LNCS, vol. 11340, pp. 335\u2013370. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11072-7_14","DOI":"10.1007\/978-3-030-11072-7_14"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Czyzowicz, J., et al.: Group evacuation on a line by agents with different communication abilities. 212, 57:1\u201357:24 (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2021.57","DOI":"10.4230\/LIPIcs.ISAAC.2021.57"},{"key":"13_CR18","doi-asserted-by":"publisher","unstructured":"Czyzowicz, J., Kranakis, E., Krizanc, D., Narayanan, L., Opatrny, J.: Search on a line with faulty robots. Distrib. Comput. 32(6), 493\u2013504 (2019). https:\/\/doi.org\/10.1007\/s00446-017-0296-0","DOI":"10.1007\/s00446-017-0296-0"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-030-79527-6_12","volume-title":"Structural Information and Communication Complexity","author":"H Devillez","year":"2021","unstructured":"Devillez, H., Egressy, B., Fritsch, R., Wattenhofer, R.: Two-agent tree evacuation. In: Jurdzi\u0144ski, T., Schmid, S. (eds.) SIROCCO 2021. LNCS, vol. 12810, pp. 204\u2013221. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79527-6_12"},{"key":"13_CR20","doi-asserted-by":"publisher","unstructured":"Feinerman, O., Korman, A., Lotker, Z., Sereni, J.: Collaborative search on the plane without communication. In: Kowalski, D., Panconesi, A. (eds.) ACM Symposium on Principles of Distributed Computing (PODC 2012), Funchal, Madeira, Portugal, 16\u201318 July 2012, pp. 77\u201386. ACM (2012). https:\/\/doi.org\/10.1145\/2332432.2332444","DOI":"10.1145\/2332432.2332444"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Gal, S.: Search games. Wiley Encyclopedia of Operations Research and Management Science (2010)","DOI":"10.1002\/9780470400531.eorms0912"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Georgiou, K., Karakostas, G., Kranakis, E.: Search-and-fetch with 2 robots on a disk: wireless and face-to-face communication models. arXiv preprint arXiv:1611.10208 (2016)","DOI":"10.5220\/0006091600150026"},{"key":"13_CR23","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. In: Liberatore, F., Parlier, G.H., Demange, M. (eds.) Proceedings of the 6th International Conference on Operations Research and Enterprise Systems (ICORES 2017), Porto, Portugal, 23\u201325 February 2017, pp. 15\u201326. SciTePress (2017). https:\/\/doi.org\/10.5220\/0006091600150026","DOI":"10.5220\/0006091600150026"},{"key":"13_CR24","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":"13_CR25","unstructured":"Kao, M., Reif, J.H., Tate, S.R.: Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem. pp. 441\u2013447 (1993). http:\/\/dl.acm.org\/citation.cfm?id=313559.313848"},{"key":"13_CR26","unstructured":"Kleinberg, J.M.: On-line search in a simple polygon. In: Sleator, D.D. (ed.) Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23\u201325 January 1994, Arlington, Virginia, USA, pp. 8\u201315. ACM\/SIAM (1994). http:\/\/dl.acm.org\/citation.cfm?id=314464.314473"},{"key":"13_CR27","doi-asserted-by":"publisher","first-page":"191617","DOI":"10.1109\/ACCESS.2020.3030190","volume":"8","author":"JP Queralta","year":"2020","unstructured":"Queralta, J.P., et al.: Collaborative multi-robot search and rescue: planning, coordination, perception, and active vision. IEEE Access 8, 191617\u2013191643 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.3030190","journal-title":"IEEE Access"},{"key":"13_CR28","doi-asserted-by":"publisher","unstructured":"Spieser, K., Frazzoli, E.: The cow-path game: a competitive vehicle routing problem. In: Proceedings of the 51th IEEE Conference on Decision and Control (CDC 2012), 10\u201313 December 2012, Maui, HI, USA, pp. 6513\u20136520. IEEE (2012). https:\/\/doi.org\/10.1109\/CDC.2012.6426279","DOI":"10.1109\/CDC.2012.6426279"},{"key":"13_CR29","doi-asserted-by":"publisher","unstructured":"Yao, A.C.: Probabilistic computations: toward a unified measure of complexity (extended abstract). In: 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October\u20131 November 1977, pp. 222\u2013227. IEEE Computer Society (1977). https:\/\/doi.org\/10.1109\/SFCS.1977.24","DOI":"10.1109\/SFCS.1977.24"}],"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-32733-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T23:06:18Z","timestamp":1684969578000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32733-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031327322","9783031327339"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32733-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"25 May 2023","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":"Alcal\u00e1 de Henares","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2023.networks.imdea.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"48","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":"26","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":"54% - 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","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":"5","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)"}}]}}