A framework for pursuit evasion games in Rn

Authors:
Swastik Kopparty;Chinya V. Ravishankar
Affiliations:
Computer Science & Engineering Department, University of California, Riverside, CA;Computer Science & Engineering Department, University of California, Riverside, CA
Venue:
Information Processing Letters
Year:
2005

Citing 7
Cited 1

Unbounded unimodal search and pursuit problems

Unbounded unimodal search and pursuit problems
Randomized algorithms

Randomized algorithms
Solution of David Gale's lion and man problem

Theoretical Computer Science
Simple algorithms for searching a polygon with flashlights

Information Processing Letters
Lectures on Discrete Geometry

Lectures on Discrete Geometry
Visibility-Based Pursuit-Evasion in a Polygonal Environment

WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Randomized Pursuit-Evasion in Graphs

Combinatorics, Probability and Computing

Game-theoretic analysis of a visibility based pursuit-evasion game in the presence of obstacles

ACC'09 Proceedings of the 2009 conference on American Control Conference

Quantified Score

Hi-index	0.89

Visualization

Abstract

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.