{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:27Z","timestamp":1759637547795,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030140939"},{"type":"electronic","value":"9783030140946"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-14094-6_5","type":"book-chapter","created":{"date-parts":[[2019,2,14]],"date-time":"2019-02-14T08:58:51Z","timestamp":1550134731000},"page":"62-82","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Average Case - Worst Case Tradeoffs for Evacuating 2 Robots from the Disk in the Face-to-Face Model"],"prefix":"10.1007","author":[{"given":"Huda","family":"Chuangpishit","sequence":"first","affiliation":[]},{"given":"Konstantinos","family":"Georgiou","sequence":"additional","affiliation":[]},{"given":"Preeti","family":"Sharma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,15]]},"reference":[{"key":"5_CR1","volume-title":"Search Problems","author":"R Ahlswede","year":"1987","unstructured":"Ahlswede, R., Wegener, I.: Search Problems. Wiley-Interscience, Hoboken (1987)"},{"issue":"4","key":"5_CR2","doi-asserted-by":"publisher","first-page":"1164","DOI":"10.1137\/S009753979732428X","volume":"29","author":"S Albers","year":"2000","unstructured":"Albers, S., Henzinger, M.R.: Exploring unknown environments. SIAM J. Comput. 29(4), 1164\u20131188 (2000)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"5_CR3","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)","journal-title":"Algorithmica"},{"key":"5_CR4","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous, vol. 55. Kluwer Academic Publishers (2002)"},{"key":"5_CR5","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). \n                    https:\/\/doi.org\/10.1007\/978-1-4614-6825-7_14"},{"issue":"2","key":"5_CR6","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."},{"issue":"2","key":"5_CR7","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":"5_CR8","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."},{"issue":"3","key":"5_CR9","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."},{"issue":"4","key":"5_CR10","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1002\/1520-6750(199108)38:4<469::AID-NAV3220380404>3.0.CO;2-E","volume":"38","author":"S Benkoski","year":"1991","unstructured":"Benkoski, S., Monticino, M., Weisinger, J.: A survey of the search theory literature. Nav. Res. Logist. (NRL) 38(4), 469\u2013494 (1991)","journal-title":"Nav. Res. Logist. (NRL)"},{"key":"5_CR11","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). \n                    https:\/\/doi.org\/10.1007\/978-3-319-57586-5_10"},{"issue":"3","key":"5_CR12","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1109\/TRO.2004.839232","volume":"21","author":"W Burgard","year":"2005","unstructured":"Burgard, W., Moors, M., Stachniss, C., Schneider, F.E.: Coordinated multi-robot exploration. IEEE Trans. Rob. 21(3), 376\u2013386 (2005)","journal-title":"IEEE Trans. Rob."},{"key":"5_CR13","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). \n                    https:\/\/doi.org\/10.1007\/978-3-662-46078-8_14"},{"issue":"4","key":"5_CR14","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10514-011-9241-4","volume":"31","author":"TH Chung","year":"2011","unstructured":"Chung, T.H., Hollinger, G.A., Isler, V.: Search and pursuit-evasion in mobile robotics. Auton. Rob. 31(4), 299\u2013316 (2011)","journal-title":"Auton. Rob."},{"key":"5_CR15","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":"5_CR16","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). \n                    https:\/\/doi.org\/10.1007\/978-3-662-45174-8_9"},{"key":"5_CR17","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 a faulty robot. In: Das, S., Tixeuil, S. (eds.) SIROCCO 2017. LNCS, vol. 10641, pp. 158\u2013173. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-72050-0_10"},{"key":"5_CR18","unstructured":"Czyzowicz, J., et al.: God save the queen. In: 9th International Conference on Fun with Algorithms (FUN 2018) (2018)"},{"key":"5_CR19","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). \n                    https:\/\/doi.org\/10.1007\/978-3-030-01325-7_32"},{"key":"5_CR20","unstructured":"Czyzowicz, J., et al.: Search on a line by byzantine robots. In: 27th International Symposium on Algorithms and Computation, ISAAC 2016, Sydney, Australia, 12\u201314 December 2016, pp. 27:1\u201327:12 (2016)"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-319-18173-8_10","volume-title":"Algorithms and Complexity","author":"J Czyzowicz","year":"2015","unstructured":"Czyzowicz, J., Georgiou, K., Kranakis, E., Narayanan, L., Opatrny, J., Vogtenhuber, B.: Evacuating robots from a disk using face-to-face communication (extended abstract). In: Paschos, V.T., Widmayer, P. (eds.) CIAC 2015. LNCS, vol. 9079, pp. 140\u2013152. Springer, Cham (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-319-18173-8_10"},{"key":"5_CR22","unstructured":"Deng, X., Kameda, T., Papadimitriou, C.: How to learn an unknown environment. In: FOCS, pp. 298\u2013303. IEEE (1991)"},{"issue":"3","key":"5_CR23","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1287\/opre.16.3.525","volume":"16","author":"J Dobbie","year":"1968","unstructured":"Dobbie, J.: A survey of search theory. Oper. Res. 16(3), 525\u2013537 (1968)","journal-title":"Oper. Res."},{"key":"5_CR24","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). \n                    https:\/\/doi.org\/10.1007\/978-3-642-17458-2_3"},{"issue":"3","key":"5_CR25","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.tcs.2008.02.040","volume":"399","author":"FV Fomin","year":"2008","unstructured":"Fomin, F.V., Thilikos, D.M.: An annotated bibliography on guaranteed graph searching. Theoret. Comput. Sci. 399(3), 236\u2013245 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR26","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 - (track: wireless and geometry). In: Chrobak, M., Fern\u00e1ndez Anta, A., G\u0105sieniec, L., Klasing, R. (eds.) ALGOSENSORS 2016. LNCS, vol. 10050, pp. 80\u201394. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-53058-1_6"},{"key":"5_CR27","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. 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)","DOI":"10.5220\/0006091600150026"},{"key":"5_CR28","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":"2","key":"5_CR29","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1137\/S0097539799348670","volume":"31","author":"F Hoffmann","year":"2001","unstructured":"Hoffmann, F., Icking, C., Klein, R., Kriegel, K.: The polygon exploration problem. SIAM J. Comput. 31(2), 577\u2013600 (2001)","journal-title":"SIAM J. Comput."},{"key":"5_CR30","unstructured":"Kleinberg, J.: On-line search in a simple polygon. In: SODA, p. 8. SIAM (1994)"},{"key":"5_CR31","unstructured":"Lidbetter, T.: Hide-and-seek and other search games. Ph.D. thesis, The London School of Ecoomics and Political Science (LSE) (2013)"},{"key":"5_CR32","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/B978-044482537-7\/50016-4","volume":"334","author":"JSB Mitchell","year":"2000","unstructured":"Mitchell, J.S.B.: Geometric shortest paths and network optimization. Handb. Comput. Geom. 334, 633\u2013702 (2000)","journal-title":"Handb. Comput. Geom."},{"key":"5_CR33","doi-asserted-by":"crossref","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":"5_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/BFb0035787","volume-title":"Automata, Languages and Programming","author":"CH Papadimitriou","year":"1989","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Shortest paths without a map. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds.) ICALP 1989. LNCS, vol. 372, pp. 610\u2013620. Springer, Heidelberg (1989). \n                    https:\/\/doi.org\/10.1007\/BFb0035787"},{"key":"5_CR35","volume-title":"Theory of Optimal Search","author":"L Stone","year":"1975","unstructured":"Stone, L.: Theory of Optimal Search. Academic Press, New York (1975)"},{"issue":"5","key":"5_CR36","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1177\/02783640122067435","volume":"20","author":"S Thrun","year":"2001","unstructured":"Thrun, S.: A probabilistic on-line mapping algorithm for teams of mobile robots. Int. J. Rob. Res. 20(5), 335\u2013363 (2001)","journal-title":"Int. J. Rob. Res."},{"key":"5_CR37","doi-asserted-by":"crossref","unstructured":"Yamauchi, B.: Frontier-based exploration using multiple robots. In: Proceedings of the Second International Conference on Autonomous Agents, pp. 47\u201353. ACM (1998)","DOI":"10.1145\/280765.280773"}],"container-title":["Lecture Notes in Computer Science","Algorithms for Sensor Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-14094-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T07:36:04Z","timestamp":1558337764000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-14094-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030140939","9783030140946"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-14094-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"15 February 2019","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":"Helsinki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Finland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algosensors2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo2018.hiit.fi\/algosensors\/cfp\/","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"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"39","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"38% - 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"}},{"value":"2.9","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}