{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T19:32:52Z","timestamp":1770751972817,"version":"3.50.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662451731","type":"print"},{"value":"9783662451748","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45174-8_9","type":"book-chapter","created":{"date-parts":[[2014,9,29]],"date-time":"2014-09-29T15:28:20Z","timestamp":1412004500000},"page":"122-136","source":"Crossref","is-referenced-by-count":41,"title":["Evacuating Robots via Unknown Exit in a Disk"],"prefix":"10.1007","author":[{"given":"Jurek","family":"Czyzowicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leszek","family":"G\u0105sieniec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Gorry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Russell","family":"Martin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominik","family":"Pajak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"9_CR1","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.\u00a029(4), 1164\u20131188 (2000)","journal-title":"SIAM J. Comput."},{"key":"9_CR2","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\u00a032, 123\u2013143 (2002)","journal-title":"Algorithmica"},{"key":"9_CR3","unstructured":"Alpern, S., Gal, S.: The theory of search games and rendezvous. Int. Series in Operations research and Management Science, vol.\u00a055. Kluwer Academic Publishers (2002)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Alpern, S., Fokkink, R., G\u0105sieniec, L., Lindelauf, R., Subrahmanian, V.S(eds.): Search Theory, A Game Theoretic Approach. Springer (2013)","DOI":"10.1007\/978-1-4614-6825-7"},{"issue":"2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1993.1054","volume":"106","author":"R.A. Baeza-Yates","year":"1993","unstructured":"Baeza-Yates, R.A., Culberson, J.C., Rawlins, G.J.E.: Searching in the Plane. Inf. Comput.\u00a0106(2), 234\u2013252 (1993)","journal-title":"Inf. Comput."},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0925-7721(95)00003-R","volume":"5","author":"R.A. Baeza-Yates","year":"1995","unstructured":"Baeza-Yates, R.A., Schott, R.: Parallel Searching in the Plane. Comput. Geom.\u00a05, 143\u2013154 (1995)","journal-title":"Comput. Geom."},{"issue":"2","key":"9_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.\u00a034(2), 499\u2013512 (2009)","journal-title":"Math. Oper. Res."},{"key":"9_CR8","first-page":"221","volume":"2","author":"A. Beck","year":"1964","unstructured":"Beck, A.: On the linear search Problem. Naval Res. Logist.\u00a02, 221\u2013228 (1964)","journal-title":"Naval Res. Logist."},{"key":"9_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 problem. SIAM Rev.\u00a05, 274 (1963)","journal-title":"SIAM Rev."},{"issue":"3","key":"9_CR10","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 Transactions on Robotics\u00a021(3), 376\u2013386 (2005)","journal-title":"IEEE Transactions on Robotics"},{"key":"9_CR11","unstructured":"Chrobak, M., G\u0105sieniec, L., Gorry, T., Martin, R.: Evacuation problem on the line (in preparation)"},{"issue":"4","key":"9_CR12","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10514-011-9241-4","volume":"31","author":"T.H. Chung","year":"2011","unstructured":"Chung, T.H., Hollinger, G.A., Isler, V.: Search and pursuit-evasion in mobile robotics. Autonomous Robots\u00a031(4), 299\u2013316 (2011)","journal-title":"Autonomous Robots"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Deng, X., Kameda, T., Papadimitriou, C.H.: How to learn an unknown environment. In: Proc. 32nd Symp. on Foundations of Computer Science, pp. 298\u2013303 (1991)","DOI":"10.1109\/SFCS.1991.185382"},{"key":"9_CR14","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, Part I. LNCS, vol.\u00a06508, pp. 21\u201330. Springer, Heidelberg (2010)"},{"issue":"3","key":"9_CR15","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.tcs.2008.02.040","volume":"399","author":"F.V. Fomin","year":"2008","unstructured":"Fomin, F.V., Thilikos, D.M.: An annotated bibliography on guaranteed graph searching. Theoretical Computer Science\u00a0399(3), 236\u2013245 (2008)","journal-title":"Theoretical Computer Science"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Gluss, B.: An alternative solution to the \u201clost at sea\u201d problem. Naval Research Logistics Quarterly\u00a08(1), 117\u2013122 (1961)","DOI":"10.1002\/nav.3800080108"},{"key":"9_CR17","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. Comp.\u00a031, 577\u2013600 (2001)","journal-title":"SIAM J. Comp."},{"issue":"4","key":"9_CR18","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1002\/nav.3800140411","volume":"14","author":"J. Isbell","year":"1967","unstructured":"Isbell, J.: Pursuit Around a Hole. Naval Research Logistics Quarterly\u00a014(4), 569\u2013571 (1967)","journal-title":"Naval Research Logistics Quarterly"},{"key":"9_CR19","unstructured":"Kijima, S., Yamashita, M., Yamauchi, Y.: Private communication (2013)"},{"key":"9_CR20","unstructured":"Kleinberg, J.M.: On-line Search in a Simple Polygon. In: SODA, pp. 8\u201315 (1994)"},{"key":"9_CR21","unstructured":"Lidbetter, T.: Hide-and-seek and Other Search Games, PhD Thesis. London School of Economics (2013)"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Mitchell, J.S.B.: Geometric shortest paths and network optimization. In: Handbook of Computational Geometry, pp. 633\u2013702 (2000)","DOI":"10.1016\/B978-044482537-7\/50016-4"},{"key":"9_CR23","volume-title":"Chases and Escapes: The Mathematics of Pursuit and Evasion","author":"P. Nahin","year":"2007","unstructured":"Nahin, P.: Chases and Escapes: The Mathematics of Pursuit and Evasion. Princeton University Press, Princeton (2007)"},{"key":"9_CR24","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0304-3975(91)90263-2","volume":"84","author":"C.H. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Shortest paths without a map. Theor. Comput. Sci.\u00a084, 127\u2013150 (1991)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"9_CR25","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. I. J. Robotic Res.\u00a020(5), 335\u2013363 (2001)","journal-title":"I. J. Robotic Res."},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Yamauchi, B.: Frontier-Based Exploration Using Multiple Robots. In: Agents, pp. 47\u201353 (1998)","DOI":"10.1145\/280765.280773"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45174-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T22:11:33Z","timestamp":1746396693000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45174-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662451731","9783662451748"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45174-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}