TY - JOUR
T1 - A framework for pursuit evasion games in ℝ
AU - Kopparty, Swastik
AU - Ravishankar, Chinya V.
N1 - Funding Information:
This work was supported in part by a grant from Tata Consultancy Services, Inc., by a matching grant from the Discovery Program of the University of California, and by contract F30602-01-2-0536 from the Defense Advanced Research Projects Agency.
PY - 2005/11/15
Y1 - 2005/11/15
N2 - We present a framework for solving pursuit evasion games in Rn for the case of N pursuers and a single evader. We give two algorithms that capture the evader in a number of steps linear in the original pursuer-evader distances. We also show how to generalize our results to a convex playing field with finitely many hyperplane boundaries that serve as obstacles.
AB - We present a framework for solving pursuit evasion games in Rn for the case of N pursuers and a single evader. We give two algorithms that capture the evader in a number of steps linear in the original pursuer-evader distances. We also show how to generalize our results to a convex playing field with finitely many hyperplane boundaries that serve as obstacles.
KW - Computational geometry
KW - Lion-man problem
KW - Pursuit evasion game
UR - http://www.scopus.com/inward/record.url?scp=24644490879&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=24644490879&partnerID=8YFLogxK
U2 - 10.1016/j.ipl.2005.04.012
DO - 10.1016/j.ipl.2005.04.012
M3 - Article
AN - SCOPUS:24644490879
VL - 96
SP - 114
EP - 122
JO - Information Processing Letters
JF - Information Processing Letters
SN - 0020-0190
IS - 3
ER -