Randomized pursuit-evasion in a polygonal environment

Volkan Isler; Sampath Kannan; Sanjeev Khanna

doi:10.1109/TRO.2005.851373

Randomized pursuit-evasion in a polygonal environment

Volkan Isler, Sampath Kannan, Sanjeev Khanna

Computer Science and Engineering

Research output: Contribution to journal › Article › peer-review

163 Scopus citations

Abstract

This paper contains two main results. First, we revisit the well-known visibility-based pursuit-evasion problem, and show that in contrast to deterministic strategies, a single pursuer can locate an unpredictable evader in any simply connected polygonal environment, using a randomized strategy. The evader can be arbitrarily faster than the pursuer, and it may know the position of the pursuer at all times, but it does not have prior knowledge of the random decisions made by the pursuer. Second, using the randomized algorithm, together with the solution to a problem called the "lion and man problem" as subroutines, we present a strategy for two pursuers (one of which is at least as fast as the evader) to quickly capture an evader in a simply connected polygonal environment. We show how this strategy can be extended to obtain a strategy for a polygonal room with a door, two pursuers who have only line-of-sight communication, and a single pursuer (at the expense of increased capture time).

Original language	English (US)
Pages (from-to)	875-884
Number of pages	10
Journal	IEEE Transactions on Robotics
Volume	21
Issue number	5
DOIs	https://doi.org/10.1109/TRO.2005.851373
State	Published - Oct 2005

Bibliographical note

Funding Information:
Manuscript received July 27, 2004; revised December 22, 2004. This paper was recommended for publication by Associate Editor D. Fox and Editor I. Walker upon evaluation of the reviewers’ comments. The work of V. Isler was supported in part by MURI under DAAH-19-02-1-03-83. The work of S. Kannan was supported in part by the National Science Foundation under Grant CCR0105337 and in part by the Army Research Office under Grant DAAD19-01-1-0473. The work of S. Khanna was supported in part by an Alfred P. Sloan Research Fellowship and in part by the NSF under Career Award CCR-0093117. This paper was presented in part at the Workshop on Algorithmic Foundations of Robotics, Utrecht/Zeist, The Netherlands, July 2004.

Keywords

Dynamic noncooperative game theory
Path planning
Pursuit-evasion games
Randomized algorithms

Access

10.1109/TRO.2005.851373

OpenUrl availability

Full text

Cite this

@article{67a17a8d89fd4ccbbd7c5474e69857e7,

title = "Randomized pursuit-evasion in a polygonal environment",

abstract = "This paper contains two main results. First, we revisit the well-known visibility-based pursuit-evasion problem, and show that in contrast to deterministic strategies, a single pursuer can locate an unpredictable evader in any simply connected polygonal environment, using a randomized strategy. The evader can be arbitrarily faster than the pursuer, and it may know the position of the pursuer at all times, but it does not have prior knowledge of the random decisions made by the pursuer. Second, using the randomized algorithm, together with the solution to a problem called the {"}lion and man problem{"} as subroutines, we present a strategy for two pursuers (one of which is at least as fast as the evader) to quickly capture an evader in a simply connected polygonal environment. We show how this strategy can be extended to obtain a strategy for a polygonal room with a door, two pursuers who have only line-of-sight communication, and a single pursuer (at the expense of increased capture time).",

keywords = "Dynamic noncooperative game theory, Path planning, Pursuit-evasion games, Randomized algorithms",

author = "Volkan Isler and Sampath Kannan and Sanjeev Khanna",

note = "Funding Information: Manuscript received July 27, 2004; revised December 22, 2004. This paper was recommended for publication by Associate Editor D. Fox and Editor I. Walker upon evaluation of the reviewers{\textquoteright} comments. The work of V. Isler was supported in part by MURI under DAAH-19-02-1-03-83. The work of S. Kannan was supported in part by the National Science Foundation under Grant CCR0105337 and in part by the Army Research Office under Grant DAAD19-01-1-0473. The work of S. Khanna was supported in part by an Alfred P. Sloan Research Fellowship and in part by the NSF under Career Award CCR-0093117. This paper was presented in part at the Workshop on Algorithmic Foundations of Robotics, Utrecht/Zeist, The Netherlands, July 2004.",

year = "2005",

month = oct,

doi = "10.1109/TRO.2005.851373",

language = "English (US)",

volume = "21",

pages = "875--884",

journal = "IEEE Transactions on Robotics",

issn = "1552-3098",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "5",

}

TY - JOUR

T1 - Randomized pursuit-evasion in a polygonal environment

AU - Isler, Volkan

AU - Kannan, Sampath

AU - Khanna, Sanjeev

N1 - Funding Information: Manuscript received July 27, 2004; revised December 22, 2004. This paper was recommended for publication by Associate Editor D. Fox and Editor I. Walker upon evaluation of the reviewers’ comments. The work of V. Isler was supported in part by MURI under DAAH-19-02-1-03-83. The work of S. Kannan was supported in part by the National Science Foundation under Grant CCR0105337 and in part by the Army Research Office under Grant DAAD19-01-1-0473. The work of S. Khanna was supported in part by an Alfred P. Sloan Research Fellowship and in part by the NSF under Career Award CCR-0093117. This paper was presented in part at the Workshop on Algorithmic Foundations of Robotics, Utrecht/Zeist, The Netherlands, July 2004.

PY - 2005/10

Y1 - 2005/10

N2 - This paper contains two main results. First, we revisit the well-known visibility-based pursuit-evasion problem, and show that in contrast to deterministic strategies, a single pursuer can locate an unpredictable evader in any simply connected polygonal environment, using a randomized strategy. The evader can be arbitrarily faster than the pursuer, and it may know the position of the pursuer at all times, but it does not have prior knowledge of the random decisions made by the pursuer. Second, using the randomized algorithm, together with the solution to a problem called the "lion and man problem" as subroutines, we present a strategy for two pursuers (one of which is at least as fast as the evader) to quickly capture an evader in a simply connected polygonal environment. We show how this strategy can be extended to obtain a strategy for a polygonal room with a door, two pursuers who have only line-of-sight communication, and a single pursuer (at the expense of increased capture time).

AB - This paper contains two main results. First, we revisit the well-known visibility-based pursuit-evasion problem, and show that in contrast to deterministic strategies, a single pursuer can locate an unpredictable evader in any simply connected polygonal environment, using a randomized strategy. The evader can be arbitrarily faster than the pursuer, and it may know the position of the pursuer at all times, but it does not have prior knowledge of the random decisions made by the pursuer. Second, using the randomized algorithm, together with the solution to a problem called the "lion and man problem" as subroutines, we present a strategy for two pursuers (one of which is at least as fast as the evader) to quickly capture an evader in a simply connected polygonal environment. We show how this strategy can be extended to obtain a strategy for a polygonal room with a door, two pursuers who have only line-of-sight communication, and a single pursuer (at the expense of increased capture time).

KW - Dynamic noncooperative game theory

KW - Path planning

KW - Pursuit-evasion games

KW - Randomized algorithms

UR - http://www.scopus.com/inward/record.url?scp=27144454543&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=27144454543&partnerID=8YFLogxK

U2 - 10.1109/TRO.2005.851373

DO - 10.1109/TRO.2005.851373

M3 - Article

AN - SCOPUS:27144454543

SN - 1552-3098

VL - 21

SP - 875

EP - 884

JO - IEEE Transactions on Robotics

JF - IEEE Transactions on Robotics

IS - 5

ER -

Randomized pursuit-evasion in a polygonal environment

Abstract

Bibliographical note

Keywords

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this