{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:15:30Z","timestamp":1725664530586},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602200"},{"type":"electronic","value":"9783540447474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60220-8_57","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:52:08Z","timestamp":1330278728000},"page":"135-146","source":"Crossref","is-referenced-by-count":8,"title":["Going home through an unknown street"],"prefix":"10.1007","author":[{"given":"Alejandro","family":"L\u00f3pez-Ortiz","sequence":"first","affiliation":[]},{"given":"Sven","family":"Schuierer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1993.1054","volume":"106","author":"R. Baeza-Yates","year":"1993","unstructured":"R. Baeza-Yates, J. Culberson and G. Rawlins. \u201cSearching in the plane\u201d, Information and Computation, Vol. 106, (1993), pp. 234\u2013252.","journal-title":"Information and Computation"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"A. Blum, P. Raghavan and B. Schieber. \u201cNavigating in unfamiliar geometric terrain\u201c, Proc. of 23rd ACM Symp. on Theory of Computing, (1991), pp. 494\u2013504.","DOI":"10.1145\/103418.103419"},{"key":"12_CR3","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1142\/S0218195993000154","volume":"3","author":"K-F. Chan","year":"1993","unstructured":"K-F. Chan and T. W. Lam. \u201cAn on-line algorithm for navigating in an unknown environment\u201d, International Journal of Computational Geometry & Applications, Vol. 3, (1993), pp. 227\u2013244.","journal-title":"International Journal of Computational Geometry & Applications"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"A. Datta and Ch. Icking. \u201cCompetitive searching in a generalized street\u201d, Proc. of 10th ACM Sypm. on Computational Geometry, (1994), pp. 175\u2013182.","DOI":"10.1145\/177424.177622"},{"key":"12_CR5","volume-title":"Technical Report CS-93-04","author":"X. Deng","year":"1993","unstructured":"X. Deng, T. Kameda and C. Papadimitriou. \u201cHow to learn an unknown environment I: The rectilinear case\u201d, Technical Report CS-93-04, Department of Computer Science, York University, 1993. A preliminary version appeared in Proc. 32nd IEEE Symp. on Foundations of Computer Science, (1991), pp. 298\u2013303."},{"key":"12_CR6","unstructured":"Ch. Icking. Ph. D. Thesis, Fernuniversit\u00e4t Hagen, 1994."},{"key":"12_CR7","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0925-7721(92)90010-P","volume":"1","author":"R. Klein","year":"1992","unstructured":"R. Klein. \u201cWalking an unknown street with bounded detour\u201d, Computational Geometry: Theory and Applications\n1, (1992), pp. 325\u2013351.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"12_CR8","unstructured":"J. Kleinberg. \u201cOn-line search in a simple polygon\u201d, Proc. of 5th ACM-SIAM Symp. on Discrete Algorithms, (1994), pp. 8\u201315."},{"key":"12_CR9","unstructured":"A. L\u00f3pez-Ortiz and S. Schuierer. Simple, Efficient and Robust Strategies to Traverse Streets. Manuscript. 1995."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"A. Mei and Y. Igarashi. \u201cEfficient strategies for robot navigation in unknown environment\u201d Proc. of 21st International Colloquium on Automata, Languages and Programming, (1994), to appear.","DOI":"10.1007\/3-540-58201-0_104"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0304-3975(91)90263-2","volume":"84","author":"C. H. Papadimitriou","year":"1991","unstructured":"C. H. Papadimitriou and M. Yannakakis. \u201cShortest paths without a map\u201d, Theoretical Computer Science\n84, (1991), pp. 127\u2013150.","journal-title":"Theoretical Computer Science"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. D. Sleator","year":"1985","unstructured":"D. D. Sleator and R. E. Tarjan. \u201cAmortized efficiency of list update and paging rules\u201d, Communications of the ACM\n28, (1985), pp. 202\u2013208.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60220-8_57.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:33:44Z","timestamp":1619573624000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60220-8_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602200","9783540447474"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-60220-8_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}