{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:43:09Z","timestamp":1787323389814,"version":"build-2736575974"},"reference-count":23,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2010,1]]},"abstract":"<jats:p>We revisit the problem of pursuit-evasion in a grid introduced by Sugihara and Suzuki [SIAM J. Discrete Math., 2 (1989), pp. 126\u2013143] in the line-of-sight vision model. Consider an arbitrary evader Z with the maximum speed of 1 who moves (in a continuous way) on the streets and avenues of an $n\\times n$ grid $G_n$. The cunning evader is to be captured by a group of pursuers, possibly only one. The maximum speed of the pursuers is $s\\geq1$; s is a constant for each pursuit-evasion problem considered, but several values for s are studied. We prove several new results (no such algorithms were available for capture using one, two, or three pursuers having a constant maximum speed limit): (i) A randomized algorithm through which one pursuer A with a maximum speed of $s\\geq3$ can capture an arbitrary evader Z in $G_n$ in expected polynomial time. For instance, the expected capture time is $O(n^{1+\\log_{6\/5}16})=O(n^{16.21})$ for $s=3$, $O(n^{1+\\log12})=O(n^{4.59})$ for $s=4$, $O(n^{1+\\log60\/13})=O(n^{3.21})$ for $s=6$, and it approaches $O(n^3)$ with the further increase of s. (ii) A randomized algorithm for capturing an arbitrary evader in $O(n^3)$ expected time using two pursuers who can move slightly faster than the evader ($s=1+\\varepsilon$ for any $\\varepsilon&gt;0$). (iii) Randomized algorithms for capturing a certain \u201cpassive\u201d evader using either a single pursuer who can move slightly faster than the evader ($s=1+\\varepsilon$ for any $\\varepsilon&gt;0$) or two pursuers having the same maximum speed as the evader ($s=1$). (iv) A deterministic algorithm for capturing an arbitrary evader in $O(n^2)$ time, using three pursuers having the same maximum speed as the evader ($s=1$).<\/jats:p>","DOI":"10.1137\/070700991","type":"journal-article","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T16:40:28Z","timestamp":1284568828000},"page":"1177-1204","source":"Crossref","is-referenced-by-count":9,"title":["Vision-Based Pursuit-Evasion in a Grid"],"prefix":"10.1137","volume":"24","author":[{"given":"Adrian","family":"Dumitrescu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Howi","family":"Kok","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ichiro","family":"Suzuki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pawe\u0141","family":"\u017byli\u0144ski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2010,9,14]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548303005625"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(84)90073-8"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2010.02.002"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(84)90012-X"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.3390\/a2031069"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2008.08.001"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90218-K"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.02.039"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.12.010"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.02.040"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195999000273"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480104442169"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2006.870640"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(86)90146-5"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1145\/42267.42268"},{"key":"R16","doi-asserted-by":"crossref","unstructured":"S. W. Neufeld,\n                      A pursuit-evasion problem on a grid\n                      , Inform. Process. Lett., 58 (1996), pp. 5\u20139.","DOI":"10.1016\/0020-0190(96)00025-7"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(97)00165-9"},{"key":"R18","doi-asserted-by":"crossref","unstructured":"T. D. Parsons,\n                      Pursuit-evasion in a graph\n                      , Theory and Applications of Graphs, Lecture Notes in Math. 642, Springer, New York, 1976, pp. 426\u2013441.","DOI":"10.1007\/BFb0070400"},{"key":"R19","doi-asserted-by":"crossref","unstructured":"K. Sugihara and I. Suzuki,\n                      On a pursuit-evasion problem related to motion coordination of mobile robots\n                      , in Proceedings of the 21st Hawaii International Conference on System Sciences, Kailua-Kona, Hawaii, IEEE, 1988, pp. 218\u2013226.","DOI":"10.1109\/HICSS.1988.11987"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1137\/0402013"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1137\/0221051"},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00029-5"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2008.921544"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/070700991","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:59:48Z","timestamp":1787320788000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/070700991"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["10.1137\/070700991"],"URL":"https:\/\/doi.org\/10.1137\/070700991","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1]]}}}