{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T09:53:56Z","timestamp":1777715636836,"version":"3.51.4"},"reference-count":32,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2006,4,1]],"date-time":"2006-04-01T00:00:00Z","timestamp":1143849600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The International Journal of Robotics Research"],"published-print":{"date-parts":[[2006,4]]},"abstract":"<jats:p>We study the visibility-based pursuit-evasion problem, in which one or more searchers must move through a given environment so as to guarantee detection of any and all evaders, which can move arbitrarily fast. Our goal is to develop techniques for coordinating teams of robots to execute this task in application domains such as clearing a building, for reasons of security or safety. To this end, we introduce a new class of searcher, the \u03c6-searcher, which can be readily instantiated as a physical mobile robot. We present a detailed analysis of the pursuit-evasion problem using \u03c6-searchers. We present the first complete search algorithm for a single \u03c6-searcher, show how this algorithm can be extended to handle multiple searchers, and give examples of computed trajectories.<\/jats:p>","DOI":"10.1177\/0278364906065023","type":"journal-article","created":{"date-parts":[[2006,4,18]],"date-time":"2006-04-18T09:44:30Z","timestamp":1145353470000},"page":"299-315","source":"Crossref","is-referenced-by-count":142,"title":["Visibility-based Pursuit-evasion with Limited Field of View"],"prefix":"10.1177","volume":"25","author":[{"given":"Brian P.","family":"Gerkey","sequence":"first","affiliation":[{"name":"Artificial Intelligence Center, SRI International"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Thrun","sequence":"additional","affiliation":[{"name":"Artificial Intelligence Lab, Stanford University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Geoff","family":"Gordon","sequence":"additional","affiliation":[{"name":"Center for Automated Learning and Discovery Carnegie Mellon University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2006,4,1]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548303005625"},{"key":"atypb2","doi-asserted-by":"crossref","unstructured":"Avnaim, F., Boissonat, J. D. and Faverjon, B. (1988). Apractical exact planning algorithm for polygonal objects amidst polygonal obstacles. In Proc. of the IEEE Intl. Conf. on Robotics and Automation (ICRA), pp. 1656\u20131660.","DOI":"10.1109\/ROBOT.1988.12304"},{"key":"atypb3","doi-asserted-by":"crossref","unstructured":"Burgard, W., Fox, D., Moors, M., Simmons, R. and Thrun, S. (2000). Collaborative multi-robot exploration . In Proc. of the IEEE Intl. Conf. on Robotics and Automation (ICRA), San Francisco, California, pp. 476\u2013481 .","DOI":"10.1109\/ROBOT.2000.844100"},{"key":"atypb4","doi-asserted-by":"crossref","unstructured":"Burnikel, C., Fleischer, R., Mehlhorn, K. and Schirra, S. (1999). Efficient exact geometric computation made easy . In Proc. of the ACM Symp. on Computational Geometry, Miami Beach, Florida, pp. 341\u2013350 .","DOI":"10.1145\/304893.304988"},{"key":"atypb5","doi-asserted-by":"crossref","unstructured":"Gerkey, B. P., Thrun, S. and Gordon, G. (2005). Parallel stochastic hill-climbing with small teams. In L. E. Parker et al., eds, Multi-Robot Systems: From Swarms to Intelligent Automata, Volume III, Springer, The Netherlands , pp. 65\u201377.","DOI":"10.1007\/1-4020-3389-3_6"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195999000273"},{"key":"atypb7","unstructured":"Guibas, L. J., Motwani, R. and Raghavan, P. (1995). The robot localization problem. In K. Goldberg, J.C. Latombe, R. Wilson and D. Halperin, eds, Algorithmic Foundations of Robotics. A.K. Peters, Natick, Massachusetts , pp. 269\u2013282."},{"key":"atypb8","unstructured":"H\u00e1jek, O. (1975). Pursuit Games, Academic Press, New York ."},{"key":"atypb9","unstructured":"Isaacs, R. (1965). Differential Games: A Mathematical Theory with Applications to Warfare and Pursuit, Control and Optimization, John Wiley & Sons, New York ."},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2005.851373"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020598107671"},{"key":"atypb12","doi-asserted-by":"crossref","unstructured":"Kalra, N., Ferguson, D. and Stentz, A. (2005). Hoplites: A market-based framework for planned tight coordination in multirobot teams . In Proc. of the IEEE Intl. Conf. on Robotics and Automation (ICRA), Barcelona, Spain, pp. 1170\u20131177 .","DOI":"10.1109\/ROBOT.2005.1570274"},{"key":"atypb13","unstructured":"Koenig, S. and Simmons, R. G. (1993). Exploration with and without a map. In Proceedings of the AAAI Workshop on Learning Action Models at the Eleventh National Conference on Artificial Intelligence (AAAI), pp. 28\u201332. (Also available as AAAI Technical Report WS-93-06.)"},{"key":"atypb14","doi-asserted-by":"crossref","unstructured":"Latombe, J.C. (1991). Robot Motion Planning, Kluwer Academic Publishers, Norwell, Massachusetts .","DOI":"10.1007\/978-1-4615-4022-9"},{"key":"atypb15","doi-asserted-by":"crossref","unstructured":"LaValle, S. M., Lin, D., Guibas, L. J., Latombe, J.C. and Motwani, R. (1997). Finding an Unpredictable Target in a Workspace with Obstacles . In Proc. of the IEEE Intl. Conf. on Robotics and Automation (ICRA), Albuquerque, New Mexico, pp. 737\u2013742 .","DOI":"10.1109\/ROBOT.1997.620123"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00235-6"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(87)90038-1"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1145\/42267.42268"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(88)90028-X"},{"key":"atypb20","unstructured":"O'Rourke, J. (1987). Art Gallery Theorems and Algorithms, Oxford University Press, New York ."},{"key":"atypb21","doi-asserted-by":"crossref","unstructured":"Park, S.M., Lee, J.H. and Chwa, K.Y. (2001). Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher. In F. Orejas and P. G. Spirakis and J. van Leeuwen, eds, Automata, languages and programming, Lecture Notes in Computer Science 2076, Springer-Verlag, Berlin , pp. 456\u2013468.","DOI":"10.1007\/3-540-48224-5_38"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1080\/10798587.1999.10750747"},{"key":"atypb23","doi-asserted-by":"crossref","unstructured":"Parsons, T. (1976). Pursuit-evasion in a graph. In Y. Alavi and D. Lick, eds, Theory and Applications of Graphs, Lecture Notes in Mathematics 642, Springer-Verlag, Berlin , pp. 426\u2013441.","DOI":"10.1007\/BFb0070400"},{"key":"atypb24","unstructured":"Roy, N. and Gordon, G. (2002). Exponential Family PCA for Belief Compression in POMDPs . In Proc. of Advances in Neural Information Processing Systems (NIPS), Vancouver, Canada."},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.3160360305"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1109\/5.163407"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1177\/0278364903022001002"},{"key":"atypb28","unstructured":"Stroupe, A. (2003).\n                      Collaborative Execution of Exploration and Tracking Using Move Value Estimation for Robot Teams (MVERT)\n                      , PhD thesis, Robotics Institute, Carnegie Mellon University, Pittsburgh, Pennsylvania."},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1137\/0221051"},{"key":"atypb30","doi-asserted-by":"publisher","DOI":"10.1109\/TRA.2002.804040"},{"key":"atypb31","doi-asserted-by":"crossref","unstructured":"Werger, B. B. and Matari\u0107, M. J. (2001). Broadcast of Local Eligibility for Multi-Target Observation. In L. E. Parker, G. Bekey and J. Barhen, eds, Distributed Autonomous Robotic Systems 4, Springer-Verlag, New York , pp. 347\u2013356.","DOI":"10.1007\/978-4-431-67919-6_33"},{"key":"atypb32","doi-asserted-by":"crossref","unstructured":"Yamauchi, B. (1998). Frontier-Based Exploration Using Multiple Robots . In Proc. of Autonomous Agents, Minneapolis, Minnesota, pp. 47\u201353 .","DOI":"10.1145\/280765.280773"}],"container-title":["The International Journal of Robotics Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0278364906065023","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0278364906065023","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T10:15:45Z","timestamp":1777457745000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/0278364906065023"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,4]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,4]]}},"alternative-id":["10.1177\/0278364906065023"],"URL":"https:\/\/doi.org\/10.1177\/0278364906065023","relation":{},"ISSN":["0278-3649","1741-3176"],"issn-type":[{"value":"0278-3649","type":"print"},{"value":"1741-3176","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,4]]}}}