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.
Publication Year: 2005
Publication Date: 2005-11-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 74
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot