{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:09:31Z","timestamp":1760202571796},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662792"},{"type":"electronic","value":"9783540484479"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48447-7_11","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T21:42:14Z","timestamp":1194990134000},"page":"86-97","source":"Crossref","is-referenced-by-count":2,"title":["Robot Map Verification of a Graph World"],"prefix":"10.1007","author":[{"given":"Xiaotie","family":"Deng","sequence":"first","affiliation":[]},{"given":"Evangelos","family":"Milios","sequence":"additional","affiliation":[]},{"given":"Andy","family":"Mirzaian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,7,18]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Albers, S., Henzinger, M. R.: \u201cExploring Unknown Environments\u201d, Proc. of the 29th Annual ACM Symposium on Theory of Computing (STOC), (1997) 416\u2013425.","DOI":"10.1145\/258533.258630"},{"key":"11_CR2","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.: \u201cSearching in the Plane\u201d, Information and Computation. 106 (1993) 234\u2013252.","journal-title":"Information and Computation"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Blum, A., Raghavan, P., Schieber, B.: \u201cNavigating in Unfamiliar Geometric Terrain\u201d, Proc. of the 23rd Annual ACM Symposium on Theory of Computing (STOC), (1991) 494\u2013504.","DOI":"10.1145\/103418.103419"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1109\/70.105395","volume":"7","author":"G. Dudek","year":"1991","unstructured":"Dudek, G., Jenkin, M., Milios, E., Wilkes, D.: \u201cRobotic Exploration as Graph Construction\u201d, IEEE Trans. on Robotics and Automation\n                7 (1991) 859\u2013865.","journal-title":"IEEE Trans. on Robotics and Automation"},{"issue":"2","key":"11_CR5","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0921-8890(97)00030-4","volume":"22","author":"G. Dudek","year":"1997","unstructured":"Dudek, G., Jenkin, M., Milios, E., Wilkes, D.: \u201cMap Validation and Self-location for a Robot with a Graph-like Map\u201d, Robotics and Autonomous Systems, 22(2) (1997) 159\u2013178.","journal-title":"Robotics and Autonomous Systems"},{"issue":"2","key":"11_CR6","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. H.: \u201cHow to Learn an Unknown Environment\u201d, Journal of the ACM, 45(2) (1998) 215\u2013245.","journal-title":"Journal of the ACM"},{"issue":"4","key":"11_CR7","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1109\/70.508436","volume":"12","author":"X. Deng","year":"1996","unstructured":"Deng, X., Mirzaian, A.: \u201cCompetitive Robot Mapping with Homogeneous Markers\u201d, IEEE Trans. on Robotics and Automation\n                12(4) (1996) 532\u2013542.","journal-title":"IEEE Trans. on Robotics and Automation"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Deng, X., Papadimitriou, C. H.: \u201cExploring an Unknown Graph\u201d, Proc. of the 31st Annual IEEE Symposium on Foundations of Computer Science (FOCS), (1990) 355\u2013361.","DOI":"10.1109\/FSCS.1990.89554"},{"issue":"4","key":"11_CR9","doi-asserted-by":"publisher","first-page":"1120","DOI":"10.1137\/S0097539792233257","volume":"26","author":"L. J. Guibas","year":"1997","unstructured":"Guibas, L. J., Motwani, R., Raghavan, P.: \u201cThe robot localization problem\u201d, SIAM Journal on Computing\n                26(4) (1997) 1120\u20131138.","journal-title":"SIAM Journal on Computing"},{"key":"11_CR10","volume-title":"Topological Graph Theory","author":"J. L. Gross","year":"1987","unstructured":"Gross, J. L., Tucker, T. W.: \u201cTopological Graph Theory\u201d, John Wiley and Sons, New York, (1987)."},{"key":"11_CR11","unstructured":"Hartsfield, N., Ringel, G.: \u201cPearls in Graph Theory\u201d, Academic Press, (1990)."},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0921-8890(91)90014-C","volume":"8","author":"B. Kuipers","year":"1991","unstructured":"Kuipers, B., Byun, Y.: \u201cA Robot Exploration and Mapping Strategy Based on a Semantic Hierarchy of Spatial Representatinos\u201d, Robotics and Autonomous Systems\n                8 (1991) 47\u201363.","journal-title":"Robotics and Autonomous Systems"},{"key":"11_CR13","unstructured":"Kuipers, B., Levitt, T.: \u201cNavigation and mapping in large-scale space\u201d, AI Mag., (1988) 61\u201374."},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Kwek, S.: \u201cOn a Simple Depth-first Search Strategy for Exploring Unknown Graphs\u201d, Proc. of the 6th International Workshop on Algorithms and Data Structures (WADS), Halifax, Nova Scotia, Canada, (1997) 345\u2013353.","DOI":"10.1007\/3-540-63307-3_73"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0004-3702(90)90027-W","volume":"44","author":"T. S. Levitt","year":"1990","unstructured":"Levitt, T. S., Lawton, D. T.: \u201cQualitative Navigation for Mobile Robots\u201d, Artificial Intelligence\n                44 (1990) 305\u2013360.","journal-title":"Artificial Intelligence"},{"key":"11_CR16","unstructured":"Panaite, P., Pelc, A.: \u201cExploring Unknown Undirected Graphs\u201d, Proc. Of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (1998) 316\u2013322."},{"key":"11_CR17","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.: \u201cShortest paths without a map\u201d, Theoretical Comp. Science\n                84 (1991) 127\u2013150.","journal-title":"Theoretical Comp. Science"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1006\/inco.1993.1021","volume":"103","author":"R. L. Rivest","year":"1993","unstructured":"Rivest, R. L., Schapire, R. E.: \u201cInference of Finite Automata Using Homing Sequences\u201d, Information and Computation\n                103 (1993) 299\u2013347.","journal-title":"Information and Computation"}],"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-48447-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T07:43:14Z","timestamp":1551080594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48447-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662792","9783540484479"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-48447-7_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}