{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:32:22Z","timestamp":1759332742863},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,4,23]],"date-time":"2010-04-23T00:00:00Z","timestamp":1271980800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Auton Robot"],"published-print":{"date-parts":[[2010,7]]},"DOI":"10.1007\/s10514-010-9189-9","type":"journal-article","created":{"date-parts":[[2010,4,22]],"date-time":"2010-04-22T15:54:14Z","timestamp":1271951654000},"page":"99-118","source":"Crossref","is-referenced-by-count":22,"title":["GSST: anytime guaranteed search"],"prefix":"10.1007","volume":"29","author":[{"given":"Geoffrey","family":"Hollinger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Athanasios","family":"Kehagias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjiv","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,4,23]]},"reference":[{"key":"9189_CR1","first-page":"5","volume":"59","author":"B. Alspach","year":"2006","unstructured":"Alspach, B. (2006). Searching and sweeping graphs: a brief survey. Matematiche, 59, 5\u201337.","journal-title":"Matematiche"},{"key":"9189_CR2","doi-asserted-by":"crossref","unstructured":"Barri\u00e8re, L., Flocchini, P., Fraigniaud, P., & Santoro, N. (2002). Capture of an intruder by mobile agents. In Proc. 14th ACM symp. parallel algorithms and architectures (pp.\u00a0200\u2013209).","DOI":"10.1145\/564870.564906"},{"key":"9189_CR3","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/978-3-540-39890-5_4","volume":"2880","author":"L. Barri\u00e8re","year":"2003","unstructured":"Barri\u00e8re, L., Fraigniaud, P., Santoro, N., & Thilikos, D. (2003). Searching is not jumping. Graph-Theoretic Concepts in Computer Science, 2880, 34\u201345.","journal-title":"Graph-Theoretic Concepts in Computer Science"},{"issue":"2","key":"9189_CR4","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0196-6774(91)90003-H","volume":"12","author":"D. Bienstock","year":"1991","unstructured":"Bienstock, D., & Seymour, P. (1991). Monotonicity in graph searching. Journal of Algorithms, 12(2), 239\u2013245.","journal-title":"Journal of Algorithms"},{"issue":"3","key":"9189_CR5","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1109\/TCT.1968.1082817","volume":"15","author":"J. Char","year":"1968","unstructured":"Char, J. (1968). Generation of trees, two-trees, and storage of master forests. IEEE Transactions on Circuit Theory, 15(3), 228\u2013238.","journal-title":"IEEE Transactions on Circuit Theory"},{"key":"9189_CR6","unstructured":"Dendris, N., Kirousis, L., & Thilikos, D. (1994). Fugitive-search games on graphs and related parameters. In Proc. 20th int. workshop graph-theoretic concepts in computer science (pp.\u00a0331\u2013342)."},{"key":"9189_CR7","doi-asserted-by":"crossref","unstructured":"Flocchini, P., Nayak, A., & Schulz, A. (2005). Cleaning an arbitrary regular network with mobile agents. In Proc. int. conf. distributed computing and Internet technology (pp.\u00a0132\u2013142).","DOI":"10.1007\/11604655_17"},{"issue":"3","key":"9189_CR8","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1142\/S0129054107004838","volume":"18","author":"P. Flocchini","year":"2007","unstructured":"Flocchini, P., Huang, M., & Luccio, F. (2007). Decontamination of chordal rings and tori using mobile agents. International Journal of Foundations of Computer Science, 18(3), 547\u2013564.","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"3","key":"9189_CR9","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/net.20240","volume":"52","author":"P. Flocchini","year":"2008","unstructured":"Flocchini, P., Huang, M., & Luccio, F. (2008). Decontamination of hypercubes by mobile agents. Networks, 52(3), 167\u2013178.","journal-title":"Networks"},{"key":"9189_CR10","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.tcs.2008.02.040","volume":"399","author":"F. Fomin","year":"2008","unstructured":"Fomin, F., & Thilikos, D. (2008). An annotated bibliography on guaranteed graph searching. Theoretical Computer Science, 399, 236\u2013245.","journal-title":"Theoretical Computer Science"},{"key":"9189_CR11","unstructured":"Fomin, F., Fraigniaud, P., & Thilikos, D. (2004). The price of connectedness in expansions. Technical Report LSI-04-28-R, UPC Barcelona."},{"key":"9189_CR12","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., & Nisse, N. (2006). Connected treewidth and connected graph searching. In Proc. 7th Latin American symp. theoretical informatics.","DOI":"10.1007\/11682462_45"},{"key":"9189_CR13","unstructured":"Gerkey, B. (2004). Pursuit-evasion with teams of robots. http:\/\/ai.stanford.edu\/~gerkey\/research\/pe\/index.html ."},{"key":"9189_CR14","unstructured":"Gerkey, B., Vaughan, R., & Howard, A. (2003). The player\/stage project: tools for multi-robot and distributed sensor systems. In Proc. int. conf. advanced robotics (pp.\u00a0317\u2013323)."},{"key":"9189_CR15","doi-asserted-by":"crossref","unstructured":"Gerkey, B., Thrun, S., & Gordon, G. (2005). Parallel stochastic hill-climbing with small teams. In Proc. 3rd int. NRL workshop multi-robot systems.","DOI":"10.1007\/1-4020-3389-3_6"},{"issue":"5","key":"9189_CR16","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1142\/S0218195999000273","volume":"9","author":"L. Guibas","year":"1999","unstructured":"Guibas, L., Latombe, J., LaValle, S., Lin, D., & Motwani, R. (1999). Visibility-based pursuit-evasion in a polygonal environment. International Journal of Computational Geometry and Applications, 9(5), 471\u2013494.","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"9189_CR17","doi-asserted-by":"crossref","unstructured":"Hollinger, G., Kehagias, A., & Singh, S. (2009a). Efficient, guaranteed search with multi-agent teams. In Proc. robotics: science and systems conf.","DOI":"10.15607\/RSS.2009.V.034"},{"issue":"2","key":"9189_CR18","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1177\/0278364908099853","volume":"28","author":"G. Hollinger","year":"2009","unstructured":"Hollinger, G., Singh, S., Djugash, J., & Kehagias, A. (2009b). Efficient multi-robot search for a moving target. International Journal of Robotics Research, 28(2), 201\u2013219.","journal-title":"International Journal of Robotics Research"},{"issue":"5","key":"9189_CR19","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1109\/TRO.2005.851373","volume":"21","author":"V. Isler","year":"2005","unstructured":"Isler, V., Kannan, S., & Khanna, S. (2005). Randomized pursuit-evasion in a polygonal environment. IEEE Transactions on Robotics, 21(5), 875\u2013884.","journal-title":"IEEE Transactions on Robotics"},{"key":"9189_CR20","unstructured":"Kalra, N. (2006). A market-based framework for tightly-coupled planned coordination in multirobot teams. Ph.D. thesis, Robotics Institute, Carnegie Mellon Univ."},{"key":"9189_CR21","unstructured":"Kehagias, A., Hollinger, G., & Gelastopoulos, A. (2009a). Searching the nodes of a graph: theory and algorithms. Technical Report arXiv:0905.3359 [cs.DM]."},{"issue":"9\u201310","key":"9189_CR22","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1016\/j.mcm.2009.06.011","volume":"50","author":"A. Kehagias","year":"2009","unstructured":"Kehagias, A., Hollinger, G., & Singh, S. (2009b). A graph search algorithm for indoor pursuit\/evasion. Mathematical and Computer Modelling, 50(9\u201310), 1305\u20131317.","journal-title":"Mathematical and Computer Modelling"},{"key":"9189_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth: computations and approximations","author":"T. Kloks","year":"1994","unstructured":"Kloks, T. (1994). Treewidth: computations and approximations. Berlin: Springer."},{"key":"9189_CR24","doi-asserted-by":"crossref","unstructured":"Kolling, A., & Carpin, S. (2008). Extracting surveillance graphs from robot maps. In Proc. int. conf. intelligent robots and systems.","DOI":"10.1109\/IROS.2008.4650763"},{"key":"9189_CR25","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/TRO.2009.2035737","volume":"26","author":"A. Kolling","year":"2010","unstructured":"Kolling, A., & Carpin, S. (2010). Pursuit-evasion on trees by robot teams. IEEE Transactions on Robotics, 26, 32\u201347.","journal-title":"IEEE Transactions on Robotics"},{"issue":"4","key":"9189_CR26","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/MPRV.2004.17","volume":"3","author":"V. Kumar","year":"2004","unstructured":"Kumar, V., Rus, D., & Singh, S. (2004). Robot and sensor networks for first responders. Pervasive Computing, 3(4), 24\u201333.","journal-title":"Pervasive Computing"},{"issue":"2","key":"9189_CR27","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/151261.151263","volume":"40","author":"A. LaPaugh","year":"1993","unstructured":"LaPaugh, A. (1993). Recontamination does not help to search a graph. Journal of ACM, 40(2), 224\u2013245.","journal-title":"Journal of ACM"},{"key":"9189_CR28","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546877","volume-title":"Planning algorithms","author":"S. M. LaValle","year":"2006","unstructured":"LaValle, S. M. (2006). Planning algorithms. Cambridge: Cambridge University Press."},{"key":"9189_CR29","doi-asserted-by":"crossref","unstructured":"LaValle, S., Lin, D., Guibas, L., Latombe, J., & Motwani, R. (1997). Finding an unpredictable target in a workspace with obstacles. In Proc. IEEE international conf. robotics and automation.","DOI":"10.1109\/ROBOT.1997.620123"},{"key":"9189_CR30","unstructured":"Likhachev, M., Ferguson, D., Gordon, G., Stentz, A., & Thrun, S. (2005). Anytime dynamic A*: an anytime, replanning algorithm. In Proc. int. conf. automated planning and scheduling."},{"issue":"1","key":"9189_CR31","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/42267.42268","volume":"35","author":"N. Megiddo","year":"1988","unstructured":"Megiddo, N., Hakimi, S., Garey, M., Johnson, D., & Papadimitriou,\u00a0C. (1988). The complexity of searching a graph. Journal of ACM, 35(1), 18\u201344.","journal-title":"Journal of ACM"},{"key":"9189_CR32","first-page":"426","volume-title":"Theory and applications of graphs","author":"T. Parsons","year":"1976","unstructured":"Parsons, T. (1976). Pursuit-evasion in a graph. In Y. Alavi, & D. Lick (Eds.) Theory and applications of graphs (pp. 426\u2013441). Berlin: Springer."},{"issue":"1\u20133","key":"9189_CR33","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0925-7721(01)00047-5","volume":"22","author":"J. Shewchuk","year":"2002","unstructured":"Shewchuk, J. (2002). Delaunay refinement algorithms for triangular mesh generation. Computational Geometry: Theory and Applications, 22(1\u20133), 21\u201374.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"9189_CR34","unstructured":"Smith, T. (2007). Probabilistic planning for robotic exploration. Ph.D. thesis, Robotics Institute, Carnegie Mellon Univ."},{"key":"9189_CR35","doi-asserted-by":"crossref","unstructured":"Wilson, D. (1996). Generating random spanning trees more quickly than the cover time. In Proc. 28th ACM symp. theory of computing (pp.\u00a0296\u2013303).","DOI":"10.1145\/237814.237880"},{"key":"9189_CR36","doi-asserted-by":"crossref","unstructured":"Yang, B., Dyer, D., & Alspach, B. (2004). Sweeping graphs with large clique number. In Proc. 5th international symp. algorithms and computation (pp.\u00a0908\u2013920).","DOI":"10.1007\/978-3-540-30551-4_77"},{"issue":"3","key":"9189_CR37","first-page":"73","volume":"17","author":"S. Zilberstein","year":"1996","unstructured":"Zilberstein, S. (1996). Using anytime algorithms in intelligent systems. Artificial Intelligence Magazine, 17(3), 73\u201386.","journal-title":"Artificial Intelligence Magazine"}],"container-title":["Autonomous Robots"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10514-010-9189-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10514-010-9189-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10514-010-9189-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T19:15:56Z","timestamp":1559157356000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10514-010-9189-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,23]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["9189"],"URL":"https:\/\/doi.org\/10.1007\/s10514-010-9189-9","relation":{},"ISSN":["0929-5593","1573-7527"],"issn-type":[{"value":"0929-5593","type":"print"},{"value":"1573-7527","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,23]]}}}