{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T16:59:45Z","timestamp":1784134785885,"version":"3.55.0"},"reference-count":84,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,7,20]],"date-time":"2011-07-20T00:00:00Z","timestamp":1311120000000},"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":[[2011,11]]},"DOI":"10.1007\/s10514-011-9241-4","type":"journal-article","created":{"date-parts":[[2011,7,19]],"date-time":"2011-07-19T15:51:04Z","timestamp":1311090664000},"page":"299-316","source":"Crossref","is-referenced-by-count":444,"title":["Search and pursuit-evasion in mobile robotics"],"prefix":"10.1007","volume":"31","author":[{"given":"Timothy H.","family":"Chung","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Geoffrey A.","family":"Hollinger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Volkan","family":"Isler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2011,7,20]]},"reference":[{"issue":"3","key":"9241_CR1","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1017\/S0963548303005625","volume":"12","author":"M. Adler","year":"2003","unstructured":"Adler, M., R\u00e4cke, H., Sivadasan, N., Sohler, C., & V\u00f6cking, B. (2003). Randomized pursuit-evasion in graphs. Combinatorics, Probability & Computing, 12(3), 225\u2013244.","journal-title":"Combinatorics, Probability & Computing"},{"issue":"1","key":"9241_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(84)90073-8","volume":"8","author":"M. Aigner","year":"1984","unstructured":"Aigner, M., & Fromme, M. (1984). A\u00a0game of cops and robbers. Discrete Applied Mathematics, 8(1), 1\u201312.","journal-title":"Discrete Applied Mathematics"},{"key":"9241_CR3","volume-title":"Proc. robotics: science and systems conference","author":"S. Alexander","year":"2006","unstructured":"Alexander, S., Bishop, R., & Ghrist, R. (2006). Pursuit and evasion in non-convex domains of arbitrary dimensions. In Proc. robotics: science and systems conference."},{"key":"9241_CR4","doi-asserted-by":"crossref","first-page":"103","DOI":"10.4171\/LEM\/55-1-5","volume":"55","author":"S. Alexander","year":"2009","unstructured":"Alexander, S., Bishop, R., & Ghrist, R. (2009). Capture pursuit games on unbounded domains. L\u2019Enseignement Math\u00e9matique, 55, 103\u2013125.","journal-title":"L\u2019Enseignement Math\u00e9matique"},{"issue":"4","key":"9241_CR5","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1287\/ijoc.4.4.447","volume":"4","author":"L. Alonso","year":"1992","unstructured":"Alonso, L., Goldstein, A. S., & Reingold, E. M. (1992). Lion and man: upper and lower bounds. INFORMS Journal on Computing, 4(4), 447.","journal-title":"INFORMS Journal on Computing"},{"key":"9241_CR6","first-page":"5","volume":"59","author":"B. Alspach","year":"2004","unstructured":"Alspach, B. (2004). Searching and sweeping graphs: a brief survey. Matematiche, 59, 5\u201337.","journal-title":"Matematiche"},{"issue":"3","key":"9241_CR7","doi-asserted-by":"crossref","first-page":"1213","DOI":"10.1214\/aos\/1176349665","volume":"13","author":"D. Assaf","year":"1985","unstructured":"Assaf, D., & Zamir, S. (1985). Optimal sequential search: a Bayesian approach. Annals of Statistics, 13(3), 1213\u20131221.","journal-title":"Annals of Statistics"},{"key":"9241_CR8","first-page":"34","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":"Science"},{"key":"9241_CR9","volume-title":"Dynamic noncooperative game theory","author":"T. Ba\u015far","year":"1999","unstructured":"Ba\u015far, T., & Olsder, G. J. (1999). Dynamic noncooperative game theory. Philadelphia: Society for Industrial Mathematics."},{"issue":"4","key":"9241_CR10","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1002\/1520-6750(199108)38:4<469::AID-NAV3220380404>3.0.CO;2-E","volume":"38","author":"S. J. Benkoski","year":"1991","unstructured":"Benkoski, S. J., Monticino, M. G., & Weisinger, J. R. (1991). A\u00a0survey of the search theory literature. Naval Research Logistics, 38(4), 469\u2013494.","journal-title":"Naval Research Logistics"},{"key":"9241_CR11","volume-title":"Proc. international joint conference on artificial intelligence","author":"D. Bhadauria","year":"2011","unstructured":"Bhadauria, D., & Isler, V. (2011). Capturing an evader in a polygonal environment with obstacles. In Proc. international joint conference on artificial intelligence."},{"issue":"7","key":"9241_CR12","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1177\/0278364909354628","volume":"29","author":"S. Bhattacharya","year":"2010","unstructured":"Bhattacharya, S., & Hutchinson, S. (2010). On the existence of Nash equilibrium for a visibility based pursuit evasion game. The International Journal of Robotics Research, 29(7), 831\u2013839.","journal-title":"The International Journal of Robotics Research"},{"issue":"2","key":"9241_CR13","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. D. (1991). Monotonicity in graph searching. Journal of Algorithms, 12(2), 239\u2013245.","journal-title":"Journal of Algorithms"},{"key":"9241_CR14","doi-asserted-by":"crossref","first-page":"5958","DOI":"10.1109\/ACC.2007.4282476","volume-title":"Proc. American control conference","author":"S. D. Bopardikar","year":"2007","unstructured":"Bopardikar, S. D., Bullo, F., & Hespanha, J. P. (2007). Sensing limitations in the Lion and Man problem. In Proc. American control conference (pp.\u00a05958\u20135963)."},{"key":"9241_CR15","first-page":"59","volume-title":"Proc. international joint conference on artificial intelligence","author":"R. Borie","year":"2009","unstructured":"Borie, R., Tovey, C., & Koenig, S. (2009). Algorithms and complexity results for pursuit-evasion problems. In Proc. international joint conference on artificial intelligence (pp.\u00a059\u201366)."},{"key":"9241_CR16","first-page":"48","volume-title":"Proc. IEEE\/RSJ international conference on intelligent robots and systems","author":"F. Bourgault","year":"2003","unstructured":"Bourgault, F., Furukawa, T., & Durrant-Whyte, H. F. (2003). Coordinated decentralized search for a lost target in a Bayesian world. In Proc. IEEE\/RSJ international conference on intelligent robots and systems (pp.\u00a048\u201353)."},{"key":"9241_CR17","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/10991459_21","volume":"24","author":"F. Bourgault","year":"2006","unstructured":"Bourgault, F., Furukawa, T., & Durrant-Whyte, H. F. (2006). Optimal search for a lost target in a Bayesian world. Field and Service Robotics, 24, 209\u2013222.","journal-title":"Field and Service Robotics"},{"issue":"2","key":"9241_CR18","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1214\/aoms\/1177698965","volume":"38","author":"M. C. Chew","year":"1967","unstructured":"Chew, M. C. (1967). A\u00a0sequential search procedure. Annals of Mathematical Statistics, 38(2), 494\u2013502.","journal-title":"Annals of Mathematical Statistics"},{"issue":"3","key":"9241_CR19","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1287\/opre.21.3.741","volume":"21","author":"M. C. Chew","year":"1973","unstructured":"Chew, M. C., & Milton, C. (1973). Optimal stopping in a discrete search problem. Operations Research, 21(3), 741\u2013747.","journal-title":"Operations Research"},{"key":"9241_CR20","first-page":"243","volume-title":"Proc. international conference on information fusion","author":"F. Dambreville","year":"2002","unstructured":"Dambreville, F., & Cadre, J. P. L. (2002). Search game for a moving target with dynamically generated informations. In Proc. international conference on information fusion (pp.\u00a0243\u2013250)."},{"issue":"3","key":"9241_CR21","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1287\/opre.16.3.525","volume":"16","author":"J. M. Dobbie","year":"1968","unstructured":"Dobbie, J. M. (1968). A\u00a0survey of search theory. Operations Research, 16(3), 525\u2013537.","journal-title":"Operations Research"},{"issue":"4","key":"9241_CR22","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1287\/opre.21.4.907","volume":"21","author":"J. M. Dobbie","year":"1973","unstructured":"Dobbie, J. M. (1973). Some search problems with false contacts. Operations Research, 21(4), 907\u2013925.","journal-title":"Operations Research"},{"issue":"1","key":"9241_CR23","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1287\/opre.38.1.110","volume":"38","author":"J. N. Eagle","year":"1990","unstructured":"Eagle, J. N., & Yee, J. R. (1990). An optimal branch-and-bound procedure for the constrained path, moving target search problem. Operations Research, 38(1), 110\u2013114.","journal-title":"Operations Research"},{"key":"9241_CR24","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1115\/1.3657260","volume":"84","author":"J. Eaton","year":"1962","unstructured":"Eaton, J., & Zadeh, L. (1962). Optimal pursuit strategies in discrete-state probabilistic systems. Journal of Basic Engineering, 84, 23\u201328.","journal-title":"Journal of Basic Engineering"},{"issue":"3","key":"9241_CR25","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.tcs.2008.02.040","volume":"399","author":"F. V. Fomin","year":"2008","unstructured":"Fomin, F. V., & Thilikos, D. M. (2008). An annotated bibliography on guaranteed graph searching. Theoretical Computer Science, 399(3), 236\u2013245.","journal-title":"Theoretical Computer Science"},{"key":"9241_CR26","volume-title":"Proc. international NRL workshop on multi-robot systems","author":"B. Gerkey","year":"2005","unstructured":"Gerkey, B., Thrun, S., & Gordon, G. (2005). Parallel stochastic hill-climbing with small teams. In Proc. international NRL workshop on multi-robot systems."},{"issue":"1","key":"9241_CR27","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0304-3975(95)80026-6","volume":"143","author":"A. S. Goldstein","year":"1995","unstructured":"Goldstein, A. S., & Reingold, E. M. (1995). The complexity of pursuit on a graph. Theoretical Computer Science, 143(1), 93\u2013112.","journal-title":"Theoretical Computer Science"},{"issue":"1\u20132","key":"9241_CR28","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1002\/rob.20226","volume":"25","author":"M. Goodrich","year":"2008","unstructured":"Goodrich, M., Morse, B., Gerhardt, D., Cooper, J., Quigley, M., Adams, J., & Humphrey, C. (2008). Supporting wilderness search using a camera-equipped UAV. Journal of Field Robotics, 25(1\u20132), 89\u2013110.","journal-title":"Journal of Field Robotics"},{"issue":"5","key":"9241_CR29","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":"9241_CR30","first-page":"2272","volume-title":"Proc. IEEE conference on decision and control","author":"J. Hespanha","year":"2000","unstructured":"Hespanha, J., Prandini, M., & Sastry, S. (2000). Probabilistic pursuit-evasion games: a one-step Nash approach. In Proc. IEEE conference on decision and control (pp.\u00a02272\u20132277)."},{"issue":"1","key":"9241_CR31","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1002\/nav.20177","volume":"54","author":"R. Hohzaki","year":"2007","unstructured":"Hohzaki, R. (2007). Discrete search allocation game with false contacts. Naval Research Logistics, 54(1), 46\u201358.","journal-title":"Naval Research Logistics"},{"issue":"2","key":"9241_CR32","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. (2009). Efficient multi-robot search for a moving target. The International Journal of Robotics Research, 28(2), 201\u2013219.","journal-title":"The International Journal of Robotics Research"},{"issue":"1","key":"9241_CR33","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s10514-010-9189-9","volume":"29","author":"G. Hollinger","year":"2010","unstructured":"Hollinger, G., Kehagias, A., & Singh, S. (2010a). GSST: anytime guaranteed search. Autonomous Robots, 29(1), 99\u2013118.","journal-title":"Autonomous Robots"},{"issue":"8","key":"9241_CR34","doi-asserted-by":"crossref","first-page":"1088","DOI":"10.1177\/0278364910369949","volume":"29","author":"G. Hollinger","year":"2010","unstructured":"Hollinger, G., Kehagias, A., & Singh, S. (2010b). Improving the efficiency of clearing with multi-agent teams. The International Journal of Robotics Research, 29(8), 1088\u20131105.","journal-title":"The International Journal of Robotics Research"},{"issue":"399","key":"9241_CR35","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/j.tcs.2008.02.041","volume":"3","author":"V. Isler","year":"2008","unstructured":"Isler, V., & Karnad, N. (2008). The role of information in the cop-robber game. Theoretical Computer Science, 3(399), 179\u2013190 Special issue on graph searching.","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"9241_CR36","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"},{"issue":"20","key":"9241_CR37","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1137\/S0895480104442169","volume":"1","author":"V. Isler","year":"2006","unstructured":"Isler, V., Kannan, S., & Khanna, S. (2006). Randomized pursuit-evasion with local visibility. SIAM Journal on Discrete Mathematics, 1(20), 26\u201341.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"9241_CR38","first-page":"359","volume":"2","author":"V. Jankovic","year":"1978","unstructured":"Jankovic, V. (1978). About a man and lions. Matemati\u010dki Vesnik, 2, 359\u2013361.","journal-title":"Matemati\u010dki Vesnik"},{"issue":"4","key":"9241_CR39","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1287\/opre.19.4.894","volume":"19","author":"J. Kadane","year":"1971","unstructured":"Kadane, J. (1971). Optimal whereabouts search. Operations Research, 19(4), 894\u2013904.","journal-title":"Operations Research"},{"issue":"6","key":"9241_CR40","doi-asserted-by":"crossref","first-page":"1722","DOI":"10.1137\/0152099","volume":"52","author":"D. Kalbaugh","year":"1992","unstructured":"Kalbaugh, D. (1992). Optimal search among false contacts. SIAM Journal on Applied Mathematics, 52(6), 1722\u20131750.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"9241_CR41","first-page":"2665","volume-title":"Proc. IEEE international conference on robotics and automation","author":"N. Karnad","year":"2008","unstructured":"Karnad, N., & Isler, V. (2008). Bearing-only pursuit. In Proc. IEEE international conference on robotics and automation (pp.\u00a02665\u20132670)."},{"key":"9241_CR42","volume-title":"Proc. ICRA workshop on search and pursuit\/evasion","author":"F. Katsilieris","year":"2010","unstructured":"Katsilieris, F., Lindh\u00e9, M., Dimarogonas, D., \u00d6gren, P., & Johansson, K. (2010). Demonstration of multi-robot search and secure. In Proc. ICRA workshop on search and pursuit\/evasion."},{"issue":"11","key":"9241_CR43","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1287\/mnsc.25.11.1115","volume":"25","author":"G. Kimeldorf","year":"1979","unstructured":"Kimeldorf, G., & Smith, F. (1979). Binomial searching for a random number of multinomially hidden objects. Management Science, 25(11), 1115\u20131126.","journal-title":"Management Science"},{"issue":"1","key":"9241_CR44","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(1), 32\u201347.","journal-title":"IEEE Transactions on Robotics"},{"key":"9241_CR45","first-page":"4610","volume-title":"Proc. IEEE\/RSJ international conference on intelligent robots and systems","author":"A. Kolling","year":"2010","unstructured":"Kolling, A., Kleiner, A., Lewis, M., & Sycara, K. (2010). Pursuit-evasion in 2.5D based on team-visibility. In Proc. IEEE\/RSJ international conference on intelligent robots and systems (pp.\u00a04610\u20134616)."},{"key":"9241_CR46","first-page":"4246","volume-title":"Proc. IEEE international conference on robotics and automation","author":"A. Kolling","year":"2011","unstructured":"Kolling, A., Kleiner, A., Lewis, M., & Sycara, K. (2011). Computing and executing strategies for moving target search. In Proc. IEEE international conference on robotics and automation (pp.\u00a04246\u2013423)."},{"issue":"5","key":"9241_CR47","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1287\/opre.4.3.324","volume":"4","author":"B. O. Koopman","year":"1956","unstructured":"Koopman, B. O. (1956a). The theory of search. Part\u00a0I. Kinematic bases. Operations Research, 4(5), 324\u2013346.","journal-title":"Operations Research"},{"issue":"5","key":"9241_CR48","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1287\/opre.4.5.503","volume":"4","author":"B. O. Koopman","year":"1956","unstructured":"Koopman, B. O. (1956b). The theory of search. Part\u00a0II. Target detection. Operations Research, 4(5), 503\u2013531.","journal-title":"Operations Research"},{"issue":"5","key":"9241_CR49","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1287\/opre.5.5.613","volume":"5","author":"B. O. Koopman","year":"1957","unstructured":"Koopman, B. O. (1957). The theory of search. Part\u00a0III. The optimum distribution of searching effort. Operations Research, 5(5), 613\u2013626.","journal-title":"Operations Research"},{"issue":"7","key":"9241_CR50","doi-asserted-by":"crossref","first-page":"527","DOI":"10.2307\/2320580","volume":"86","author":"B. O. Koopman","year":"1979","unstructured":"Koopman, B. O. (1979). Search and its optimization. The American Mathematical Monthly, 86(7), 527\u2013540.","journal-title":"The American Mathematical Monthly"},{"issue":"3","key":"9241_CR51","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/j.ipl.2005.04.012","volume":"96","author":"S. Kopparty","year":"2005","unstructured":"Kopparty, S., & Ravishankar, C. V. (2005). A\u00a0framework for pursuit evasion games in Rn. Information Processing Letters, 96(3), 114\u2013122.","journal-title":"Information Processing Letters"},{"issue":"3","key":"9241_CR52","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1007\/s00186-007-0197-2","volume":"68","author":"M. Kress","year":"2008","unstructured":"Kress, M., Lin, K. Y., & Szechtman, R. (2008). Optimal discrete search with imperfect specificity. Mathematical Methods of Operations Research, 68(3), 539\u2013549.","journal-title":"Mathematical Methods of Operations Research"},{"issue":"2","key":"9241_CR53","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/151261.151263","volume":"40","author":"A. S. LaPaugh","year":"1993","unstructured":"LaPaugh, A. S. (1993). Recontamination does not help to search a graph. Journal of the Association for Computing Machinery, 40(2), 224\u2013245.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"9241_CR54","doi-asserted-by":"crossref","first-page":"3740","DOI":"10.1109\/IROS.2005.1544986","volume-title":"Proc. IEEE\/RSJ international conference on intelligent robots and systems","author":"H. Lau","year":"2005","unstructured":"Lau, H., Huang, S., & Dissanayake, G. (2005). Optimal search for multiple targets in a built environment. In Proc. IEEE\/RSJ international conference on intelligent robots and systems (pp.\u00a03740\u20133745)."},{"key":"9241_CR55","doi-asserted-by":"crossref","first-page":"3393","DOI":"10.1109\/IROS.2006.282575","volume-title":"Proc. IEEE\/RSJ international conference on intelligent robots and systems","author":"H. Lau","year":"2006","unstructured":"Lau, H., Huang, S., & Dissanayake, G. (2006). Probabilistic search for a moving target in an indoor environment. In Proc. IEEE\/RSJ international conference on intelligent robots and systems (pp.\u00a03393\u20133398)."},{"key":"9241_CR56","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":"9241_CR57","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1109\/ROBOT.1997.620123","volume-title":"Proc. IEEE international conference on robotics and automation","author":"S. LaValle","year":"1997","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 conference on robotics and automation (pp.\u00a0737\u2013742)."},{"key":"9241_CR58","unstructured":"Lazebnik, S. (2001). Visibility-based pursuit-evasion in three-dimensional environments. Technical report, CVR-TR-2001-01, Beckman Institute, University of Illinois at Urbana-Champaign."},{"issue":"2","key":"9241_CR59","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"J. K. Lenstra","year":"1981","unstructured":"Lenstra, J. K., & Kan, A. H. G. R. (1981). Complexity of vehicle routing and scheduling problems. Networks, 11(2), 221\u2013227.","journal-title":"Networks"},{"key":"9241_CR60","volume-title":"A\u00a0mathematician\u2019s miscellany","author":"J. E. Littlewood","year":"1953","unstructured":"Littlewood, J. E. (1953). A\u00a0mathematician\u2019s miscellany. London: Methuen & Co."},{"key":"9241_CR61","unstructured":"McCue, B. (1990). U-boats in the bay of Biscay: an essay in operations analysis. National Defense University Press."},{"issue":"1","key":"9241_CR62","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, C. (1988). The complexity of searching a graph. Journal of the Association for Computing Machinery, 35(1), 18\u201344.","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"3","key":"9241_CR63","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1177\/0278364907077083","volume":"26","author":"R. Murrieta-Cid","year":"2007","unstructured":"Murrieta-Cid, R., Muppirala, T., Sarmiento, A., Bhattacharya, S., & Hutchinson, S. (2007). Surveillance strategies for a pursuer with finite sensor range. The International Journal of Robotics Research, 26(3), 233\u2013253.","journal-title":"The International Journal of Robotics Research"},{"issue":"2\u20133","key":"9241_CR64","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0012-365X(83)90160-7","volume":"43","author":"R. Nowakowski","year":"1983","unstructured":"Nowakowski, R., & Winkler, P. (1983). Vertex-to-vertex pursuit in a graph. Discrete Mathematics, 43(2\u20133), 235\u2013239.","journal-title":"Discrete Mathematics"},{"issue":"8","key":"9241_CR65","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1177\/0278364910369861","volume":"29","author":"S. C. W. Ong","year":"2010","unstructured":"Ong, S. C. W., Png, S. W., Hsu, D., & Lee, W. S. (2010). Planning under uncertainty for robotic tasks with mixed observability. The International Journal of Robotics Research, 29(8), 1053\u20131068.","journal-title":"The International Journal of Robotics Research"},{"key":"9241_CR66","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1007\/3-540-48224-5_38","volume-title":"Proc. international colloquium on automata, languages and programming","author":"S.-M. Park","year":"2001","unstructured":"Park, S.-M., Lee, J.-H., & Chwa, K.-Y. (2001). Visibility-based pursuit-evasion in a polygonal region by a searcher. In Proc. international colloquium on automata, languages and programming (pp.\u00a0456\u2013468)."},{"key":"9241_CR67","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.\u00a0426\u2013441). Berlin: Springer."},{"issue":"6","key":"9241_CR68","doi-asserted-by":"crossref","first-page":"984","DOI":"10.1287\/opre.17.6.984","volume":"17","author":"S. M. Ross","year":"1969","unstructured":"Ross, S. M. (1969). A\u00a0problem in optimal search and stop. Operations Research, 17(6), 984\u2013992.","journal-title":"Operations Research"},{"key":"9241_CR69","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.artint.2005.06.002","volume":"23","author":"N. Roy","year":"2005","unstructured":"Roy, N., Gordon, G., & Thrun, S. (2005). Finding approximate POMDP solutions through belief compression. The Journal of Artificial Intelligence Research, 23, 1\u201340.","journal-title":"The Journal of Artificial Intelligence Research"},{"issue":"5","key":"9241_CR70","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1002\/nav.20411","volume":"57","author":"H. Sato","year":"2010","unstructured":"Sato, H., & Royset, J. O. (2010). Path optimization for the resource-constrained searcher. Naval Research Logistics, 57(5), 422\u2013440.","journal-title":"Naval Research Logistics"},{"issue":"1\u20132","key":"9241_CR71","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1016\/S0304-3975(00)00411-4","volume":"259","author":"J. Sgall","year":"2001","unstructured":"Sgall, J. (2001). Solution of David Gale\u2019s lion and man problem. Theoretical Computer Science, 259(1\u20132), 663\u2013670.","journal-title":"Theoretical Computer Science"},{"key":"9241_CR72","volume-title":"Theory of optimal search","author":"L. D. Stone","year":"1989","unstructured":"Stone, L. D. (1989a). Theory of optimal search (2nd edn.). San Diego: Academic Press.","edition":"2"},{"issue":"3","key":"9241_CR73","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1287\/opre.37.3.501","volume":"37","author":"L. D. Stone","year":"1989","unstructured":"Stone, L. D. (1989b). What\u2019s happened in search theory since the 1975 Lanchester prize? Operations Research, 37(3), 501\u2013506.","journal-title":"Operations Research"},{"issue":"2","key":"9241_CR74","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/MRA.2009.932529","volume":"16","author":"J. Tisdale","year":"2009","unstructured":"Tisdale, J., Kim, Z., & Hedrick, J. K. (2009). Autonomous path planning and estimation using UAVs. IEEE Robotics & Automation Magazine, 16(2), 35\u201342.","journal-title":"IEEE Robotics & Automation Magazine"},{"key":"9241_CR75","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718515","volume-title":"The vehicle routing problem","author":"P. Toth","year":"2002","unstructured":"Toth, P., & Vigo, D. (2002). The vehicle routing problem. Philadelphia: Society for Industrial Mathematics."},{"issue":"2","key":"9241_CR76","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1287\/opre.34.2.324","volume":"34","author":"K. E. Trummel","year":"1986","unstructured":"Trummel, K. E., & Weisinger, J. R. (1986). The complexity of the optimal searcher path problem. Operations Research, 34(2), 324\u2013327.","journal-title":"Operations Research"},{"issue":"5","key":"9241_CR77","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1109\/TRA.2002.804040","volume":"18","author":"R. Vidal","year":"2002","unstructured":"Vidal, R., Shakernia, O., Kim, H. J., Shim, D. H., & Sastry, S. (2002). Probabilistic pursuit-evasion games: theory, implementation, and experimental evaluation. IEEE transactions on robotics and automation, 18(5), 662\u2013669.","journal-title":"IEEE transactions on robotics and automation"},{"issue":"4","key":"9241_CR78","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s11370-009-0050-y","volume":"2","author":"M. Vieira","year":"2009","unstructured":"Vieira, M., Govindan, R., & Sukhatme, G. S. (2009). Scalable and practical pursuit-evasion with networked robots. Journal of Intelligent Service Robotics, 2(4), 247\u2013263.","journal-title":"Journal of Intelligent Service Robotics"},{"key":"9241_CR79","volume-title":"Naval operations analysis","author":"D. H. Wagner","year":"1999","unstructured":"Wagner, D. H. (1999). Naval operations analysis. Annapolis: United States Naval Institute."},{"issue":"4","key":"9241_CR80","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1287\/opre.31.4.739","volume":"31","author":"A. R. Washburn","year":"1983","unstructured":"Washburn, A. R. (1983). Search for a moving target: the FAB algorithm. Operations Research, 31(4), 739\u2013751.","journal-title":"Operations Research"},{"issue":"3","key":"9241_CR81","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1002\/(SICI)1520-6750(199804)45:3<243::AID-NAV1>3.0.CO;2-7","volume":"45","author":"A. R. Washburn","year":"1998","unstructured":"Washburn, A. R. (1998). Branch and bound methods for a search problem. Naval Research Logistics, 45(3), 243\u2013257.","journal-title":"Naval Research Logistics"},{"key":"9241_CR82","unstructured":"Washburn, A. R. (2002). Search and detection. Topics in operations research series (4th edn.) INFORMS."},{"issue":"1","key":"9241_CR83","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0020-0190(85)90108-5","volume":"21","author":"I. Wegener","year":"1985","unstructured":"Wegener, I. (1985). Optimal search with positive switch cost is NP-hard. Information Processing Letters, 21(1), 49\u201352.","journal-title":"Information Processing Letters"},{"key":"9241_CR84","doi-asserted-by":"crossref","first-page":"3169","DOI":"10.1109\/ROBOT.2005.1570598","volume-title":"Proc. IEEE international conference on robotics and automation","author":"E.-M. Wong","year":"2005","unstructured":"Wong, E.-M., Bourgault, F., & Furukawa, T. (2005). Multi-vehicle Bayesian search for multiple lost targets. In Proc. IEEE international conference on robotics and automation (pp.\u00a03169\u20133174)."}],"container-title":["Autonomous Robots"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10514-011-9241-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10514-011-9241-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10514-011-9241-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,8]],"date-time":"2024-04-08T21:38:36Z","timestamp":1712612316000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10514-011-9241-4"}},"subtitle":["A\u00a0survey"],"short-title":[],"issued":{"date-parts":[[2011,7,20]]},"references-count":84,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["9241"],"URL":"https:\/\/doi.org\/10.1007\/s10514-011-9241-4","relation":{},"ISSN":["0929-5593","1573-7527"],"issn-type":[{"value":"0929-5593","type":"print"},{"value":"1573-7527","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,20]]}}}