{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:58:05Z","timestamp":1725537485109},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041273"},{"type":"electronic","value":"9783642041280"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04128-0_23","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:16:36Z","timestamp":1252937796000},"page":"263-274","source":"Crossref","is-referenced-by-count":0,"title":["Optimality and Competitiveness of Exploring Polygons by Mobile Robots"],"prefix":"10.1007","author":[{"given":"Jurek","family":"Czyzowicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"Labourel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"23_CR1","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(1), 123\u2013143 (2002)","journal-title":"Algorithmica"},{"issue":"1-2","key":"23_CR2","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0925-7721(00)00015-8","volume":"17","author":"E.M. Arkin","year":"2000","unstructured":"Arkin, E.M., Fekete, S.P., Mitchell, J.S.B.: Approximation algorithms for lawn mowing and milling. Comput. Geom. Theory Appl.\u00a017(1-2), 25\u201350 (2000)","journal-title":"Comput. Geom. Theory Appl."},{"doi-asserted-by":"crossref","unstructured":"Chin, W., Ntafos, S.: Optimum watchman routes. In: Proc. of Symposium on Computational Geometry (SCG 1986), pp. 24\u201333 (1986)","key":"23_CR3","DOI":"10.1145\/10515.10518"},{"doi-asserted-by":"crossref","unstructured":"Deng, X., Kameda, T., Papadimitriou, C.: How to learn an unknown environment. In: Proc. of Foundations of Computer Science (FOCS ), pp. 298\u2013303 (1991)","key":"23_CR4","DOI":"10.1109\/SFCS.1991.185382"},{"issue":"2","key":"23_CR5","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/274787.274788","volume":"45","author":"X. Deng","year":"1998","unstructured":"Deng, X., Kameda, T., Papadimitriou, C.: How to learn an unknown environment: the rectilinear case. J. ACM\u00a045(2), 215\u2013245 (1998)","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"Gabriely, Y., Rimon, E.: Spanning-tree based coverage of continuous areas by a mobile robot. In: Int. Conf. of Robotics and Automaton (ICRA 2001), pp. 1927\u20131933 (2001)","key":"23_CR6","DOI":"10.1109\/ROBOT.2001.932890"},{"issue":"2","key":"23_CR7","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/MRA.2008.921542","volume":"15","author":"S. Ghosh","year":"2008","unstructured":"Ghosh, S., Burdick, J., Bhattacharya, A., Sarkar, S.: Online algorithms with discrete visibility - exploring unknown polygonal environments. Robotics & Automation Magazine\u00a015(2), 67\u201376 (2008)","journal-title":"Robotics & Automation Magazine"},{"issue":"1","key":"23_CR8","first-page":"32","volume":"9","author":"M. Hammar","year":"2002","unstructured":"Hammar, M., Nilsson, B.J., Schuierer, S.: Improved exploration of rectilinear polygons. Nordic J. of Computing\u00a09(1), 32\u201353 (2002)","journal-title":"Nordic J. of Computing"},{"key":"23_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54103-9","volume-title":"On the computational geometry of pocket machining","author":"M. Held","year":"1991","unstructured":"Held, M.: On the computational geometry of pocket machining. Springer-Verlag New York, Inc., New York (1991)"},{"issue":"2","key":"23_CR10","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.\u00a031(2), 577\u2013600 (2001)","journal-title":"SIAM J. Comput."},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/3-540-45993-6_14","volume-title":"Revised Papers from the International Workshop on Sensor Based Intelligent Robots","author":"C. Icking","year":"2002","unstructured":"Icking, C., Kamphans, T., Klein, R., Langetepe, E.: On the competitive complexity of navigation tasks. In: Revised Papers from the International Workshop on Sensor Based Intelligent Robots, London, UK, 2002, pp. 245\u2013258. Springer, London (2002)"},{"doi-asserted-by":"crossref","unstructured":"Icking, C., Kamphans, T., Klein, R., Langetepe, E.: Exploring simple grid polygons. In: In 11th Internat. Comput. Combin. Conf., pp. 524\u2013533 (2005)","key":"23_CR12","DOI":"10.1007\/11533719_53"},{"unstructured":"Kleinberg, J.M.: On-line search in a simple polygon. In: Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA 1994), pp. 8\u201315 (1994)","key":"23_CR13"},{"unstructured":"Moret, B.M.E., Collins, M., Saia, J., Yu, L.: The ice rink problem. In: Proc. of the 1st Workshop on Algorithm Engineering (1997)","key":"23_CR14"},{"issue":"3","key":"23_CR15","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0925-7721(92)90014-J","volume":"1","author":"S. Ntafos","year":"1992","unstructured":"Ntafos, S.: Watchman routes under limited visibility. Comput. Geom. Theory Appl.\u00a01(3), 149\u2013170 (1992)","journal-title":"Comput. Geom. Theory Appl."}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04128-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T15:02:49Z","timestamp":1552143769000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04128-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041273","9783642041280"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04128-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}