{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T22:52:18Z","timestamp":1740178338980,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T00:00:00Z","timestamp":1692662400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T00:00:00Z","timestamp":1692662400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100008095","name":"Carleton University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100008095","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Intell Robot Appl"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s41315-023-00286-y","type":"journal-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T07:02:12Z","timestamp":1692687732000},"page":"652-670","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Chasing an intruder with limited information"],"prefix":"10.1007","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7916-4053","authenticated-orcid":false,"given":"Doron","family":"Nussbaum","sequence":"first","affiliation":[]},{"given":"Fedor","family":"Ilitchev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,22]]},"reference":[{"issue":"1","key":"286_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(84)90073-8","volume":"8","author":"M Aigner","year":"1984","unstructured":"Aigner, M., Fromme, M.: A game of cops and robbers. Discrete Appl. Math. 8(1), 1\u201312 (1984)","journal-title":"Discrete Appl. Math."},{"key":"286_CR2","volume-title":"The Theory of Search Games and Rendezvous","author":"S Alpern","year":"2003","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Kluwer, New York (2003)"},{"key":"286_CR3","unstructured":"Bj\u00f6rnsson, Y., Bulitko, V., Sturtevant, N.R.: Tba*: time-bounded a*. In: Boutilier, C. (ed.) Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI), Pasadena, California, USA, July 11\u201317, 2009, pp. 431\u2013436 (2009)"},{"key":"286_CR4","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1613\/jair.1789","volume":"25","author":"V Bulitko","year":"2006","unstructured":"Bulitko, V., Lee, G.: Learning in real-time search: a unifying framework. J. Artif. Intell. Res. 25, 119\u2013157 (2006)","journal-title":"J. Artif. Intell. Res."},{"issue":"4","key":"286_CR5","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10514-011-9241-4","volume":"31","author":"TH Chung","year":"2011","unstructured":"Chung, T.H., Hollinger, G.A., Isler, V.: Search and pursuit-evasion in mobile robotics\u2014a survey. Auton. Robots 31(4), 299\u2013316 (2011)","journal-title":"Auton. Robots"},{"key":"286_CR6","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1002\/(SICI)1520-6750(199606)43:4<463::AID-NAV1>3.0.CO;2-5","volume":"43","author":"RF Dell","year":"1996","unstructured":"Dell, R.F., Eagle, J.N., Martins, G.H.A., Santos, A.G.: Using multiple searchers in constrained-path, moving-target search problems. Naval Res. Logist. 43, 463\u2013480 (1996)","journal-title":"Naval Res. Logist."},{"key":"286_CR7","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"issue":"1","key":"286_CR8","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/0317009","volume":"17","author":"S Gal","year":"1979","unstructured":"Gal, S.: Search games with mobile and immobile hider. SIAM J. Control Optim. 17(1), 99\u2013122 (1979)","journal-title":"SIAM J. Control Optim."},{"key":"286_CR9","volume-title":"Search Games","author":"S Gal","year":"1980","unstructured":"Gal, S.: Search Games. ISSN. Academic Press, New York (1980)"},{"key":"286_CR10","doi-asserted-by":"crossref","unstructured":"Guibas, L.J., Latombe, J.-C., LaValle, S.M., Lin, D., Motwani, R.: Visibility-based pursuit-evasion in a polygonal environment. In: Dehne, F.K.H.A., Rau-Chaplin, A., Sack, J.R., Tamassia, R. (eds.) Algorithms and Data Structures, 5th International Workshop, WADS\u201997, August 6\u20138, 1997, Proceedings. Lecture Notes in Computer Science, vol. 1272, pp. 17\u201330. Springer, Halifax (1997)","DOI":"10.1007\/3-540-63307-3_45"},{"issue":"2","key":"286_CR11","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"286_CR12","unstructured":"Ishida, T., Korf, R.E.: Moving target search. In: Mylopoulos, J., Reiter, R. (eds.) Proceedings of the 12th International Joint Conference on Artificial Intelligence, August 24\u201330, 1991, pp. 204\u2013211. Morgan Kaufmann, Sydney (1991)"},{"issue":"5","key":"286_CR13","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1109\/TRO.2005.851373","volume":"21","author":"V Isler","year":"2005","unstructured":"Isler, V., Kannan, S., Khanna, S.: Randomized pursuit-evasion in a polygonal environment. IEEE Trans. Robot. 21(5), 875\u2013884 (2005)","journal-title":"IEEE Trans. Robot."},{"key":"286_CR14","doi-asserted-by":"crossref","unstructured":"Koenig, S., Likhachev, M., Sun, X.: Speeding up moving-target search. In: Durfee, E.H., Yokoo, M., Huhns, M.N., Shehory, O. (eds.) 6th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2007), May 14\u201318, 2007, pp. 1\u20138. IFAAMAS, Honolulu (2007)","DOI":"10.1145\/1329125.1329353"},{"key":"286_CR15","unstructured":"LaValle, S.M., Lin, D., Guibas, L.J., Latombe, J.-C., Motwani, R.: Finding an unpredictable target in a workspace with obstacles. In: Proceedings of the 1997 IEEE International Conference on Robotics and Automation, April 20\u201325, 1997, pp. 737\u2013742. IEEE, Albuquerque (1997)"},{"issue":"3","key":"286_CR16","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1002\/jgt.22129","volume":"86","author":"P Loh","year":"2017","unstructured":"Loh, P., Oh, S.: Cops and robbers on planar-directed graphs. J. Graph Theory 86(3), 329\u2013340 (2017)","journal-title":"J. Graph Theory"},{"issue":"2\u20133","key":"286_CR17","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0012-365X(83)90160-7","volume":"43","author":"RJ Nowakowski","year":"1983","unstructured":"Nowakowski, R.J., Winkler, P.: Vertex-to-vertex pursuit in a graph. Discrete Math. 43(2\u20133), 235\u2013239 (1983)","journal-title":"Discrete Math."},{"key":"286_CR18","doi-asserted-by":"crossref","unstructured":"Nussbaum, D., Ilitchev, F.: Catching a robot intruder with limited information. In: Fourth IEEE International Conference on Robotic Computing (IRC2020), November 9\u201311, 2020, pp. 17\u201323 (2020)","DOI":"10.1109\/IRC.2020.00010"},{"key":"286_CR19","doi-asserted-by":"crossref","unstructured":"Nussbaum, D., Y\u00f6r\u00fck\u00e7\u00fc, A.: Moving target search with subgoal graphs. In: Brafman, R.I., Domshlak, C., Haslum, P., Zilberstein, S. (eds.) Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, ICAPS 2015, Jerusalem, Israel, June 7\u201311, 2015, pp. 179\u2013187. AAAI Press, Jerusalem (2015)","DOI":"10.1609\/icaps.v25i1.13709"},{"issue":"1\u20132","key":"286_CR20","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1016\/S0304-3975(00)00411-4","volume":"259","author":"J Sgall","year":"2001","unstructured":"Sgall, J.: Solution of David Gale\u2019s lion and man problem. Theor. Comput. Sci. 259(1\u20132), 663\u2013670 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"286_CR21","unstructured":"Sun, X., Yeoh, W., Koenig, S.: Moving target d* lite. In: van\u00a0der Hoek, W., Kaminka, G.A., Lesp\u00e9rance, Y., Luck, M., Sen, S. (eds.) 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), Toronto, Canada, May 10\u201314, 2010, Vol. 1\u20133, pp. 67\u201374 (2010)"}],"container-title":["International Journal of Intelligent Robotics and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41315-023-00286-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41315-023-00286-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41315-023-00286-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T07:24:54Z","timestamp":1698305094000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41315-023-00286-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,22]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["286"],"URL":"https:\/\/doi.org\/10.1007\/s41315-023-00286-y","relation":{},"ISSN":["2366-5971","2366-598X"],"issn-type":[{"type":"print","value":"2366-5971"},{"type":"electronic","value":"2366-598X"}],"subject":[],"published":{"date-parts":[[2023,8,22]]},"assertion":[{"value":"23 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 May 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}