{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T03:25:28Z","timestamp":1775791528470,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1993,8,1]],"date-time":"1993-08-01T00:00:00Z","timestamp":744163200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7290,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1993,8]]},"DOI":"10.1016\/0925-7721(93)90032-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:41:31Z","timestamp":1027654891000},"page":"139-155","source":"Crossref","is-referenced-by-count":16,"title":["A competitive analysis of algorithms for searching unknown scenes"],"prefix":"10.1016","volume":"3","author":[{"given":"Bala","family":"Kalyanasundaram","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kirk","family":"Pruhs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(93)90032-2_BIB1","doi-asserted-by":"crossref","unstructured":"R. Baeza-Yates, J. Culberson and G. Rawlins, Searching in the plane, Inform. Comput, to appear.","DOI":"10.1006\/inco.1993.1054"},{"key":"10.1016\/0925-7721(93)90032-2_BIB2","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1145\/103418.103419","article-title":"Navigating in unfamiliar geometric terrain","author":"Blum","year":"1991","journal-title":"Proceedings of the Twenty-Third Annual ACM Symposium of Theory of Computing"},{"key":"10.1016\/0925-7721(93)90032-2_BIB3","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0020-0190(88)90141-X","article-title":"Optimum Watchman routes","volume":"28","author":"Chin","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0925-7721(93)90032-2_BIB4","first-page":"355","article-title":"Exploring an unknown graph","author":"Deng","year":"1990","journal-title":"Proceedings of the Thirty-First Annual Symposium on Foundations of Computer Science"},{"key":"10.1016\/0925-7721(93)90032-2_BIB5","first-page":"298","article-title":"How to learn an unknown environment","author":"Deng","year":"1991","journal-title":"Proceedings of the Thirty-Second Annual Symposium on Foundations of Computer Science"},{"key":"10.1016\/0925-7721(93)90032-2_BIB6","first-page":"147","article-title":"A competitive analysis of nearest neighbor based algorithms for searching unknown scenes","author":"Kalyanasundaram","year":"1992","journal-title":"Proceedings of Ninth Annual Symposium on Theoretical Aspects of Computer Science"},{"key":"10.1016\/0925-7721(93)90032-2_BIB7","series-title":"Technical Report","article-title":"Constructing competitive tours from local information","author":"Kalyanasundaram","year":"1992"},{"key":"10.1016\/0925-7721(93)90032-2_BIB8","first-page":"278","article-title":"Lower bounds for randomized k-server and motion planning algorithms","author":"Karloff","year":"1991","journal-title":"Proceedings of the Twenty-Third Annual ACM Symposium of Theory of Computing"},{"key":"10.1016\/0925-7721(93)90032-2_BIB9","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1109\/70.59357","article-title":"Dynamic path planning in sensor-based terrain acquisition","volume":"6","author":"Lumelsky","year":"1990","journal-title":"IEEE Trans. Robot. Automat."},{"key":"10.1016\/0925-7721(93)90032-2_BIB10","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1007\/BFb0035787","article-title":"Shortest paths without a map","author":"Papadimitriou","year":"1989","journal-title":"Proceedings of the Sixteenth Annual International Colloquium on Automata, Languages, and Programming"},{"key":"10.1016\/0925-7721(93)90032-2_BIB11","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1007\/BFb0035792","article-title":"Memory vs. Randomization in on-line algorithms","author":"Raghavan","year":"1989","journal-title":"Proceedings of the Sixteenth Annual International Colloquium on Automata, Languages, and Programming"},{"key":"10.1016\/0925-7721(93)90032-2_BIB12","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1137\/0206041","article-title":"An analysis of several heuristics for the traveling salesman problem","volume":"6","author":"Rosenkrantz","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-7721(93)90032-2_BIB13","unstructured":"J. Schwartz and C. Yap, Algorithmic and Geometric Aspects of Robots (Lawrence Erlbaum, London)."}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772193900322?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772193900322?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:55:53Z","timestamp":1555138553000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0925772193900322"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,8]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,8]]}},"alternative-id":["0925772193900322"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(93)90032-2","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1993,8]]}}}