Unbounded unimodal search and pursuit problems
Unbounded unimodal search and pursuit problems
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
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
Multi-robot cooperative pursuit based on association rule data mining
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 7
International Journal of Robotics Research
Search and pursuit-evasion in mobile robotics
Autonomous Robots
Capture bounds for visibility-based pursuit evasion
Proceedings of the twenty-ninth annual symposium on Computational geometry
On Confinement of the Initial Location of an Intruder in a Multi-robot Pursuit Game
Journal of Intelligent and Robotic Systems
k-Capture in multiagent pursuit evasion, or the lion and the hyenas
Theoretical Computer Science
Hi-index | 0.89 |
We present a framework for solving pursuit evasion games in R^n 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.