2011/08/07 by Shaunak D. Bopardikar, Bopardikar, Shaunak D., Subhash Suri +1
Computer Science · Engineering · #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #Guidance and Control Systems #Military Defense Systems Analysis #Robotic Path Planning Algorithms #cs.GT
paper · pdf · doi:10.48550/arxiv.1108.1561
16 pages
arxiv created 2011/08/07 · openalex publication_date 2011/08/07 · arxiv updated 2011/08/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider the following generalization of the classical pursuit-evasion problem, which we call k-capture. A group of n pursuers (hyenas) wish to capture an evader (lion) who is free to move in an m-dimensional Euclidean space, the pursuers and the evader can move with the same maximum speed, and at least k pursuers must simultaneously reach the evader's location to capture it. If fewer than k pursuers reach the evader, then those pursuers get destroyed by the evader. Under what conditions can the evader be k-captured? We study this problem in the discrete time, continuous space model and prove that k-capture is possible if and only there exists a time when the evader lies in the interior of the pursuers' k-Hull. When the pursuit occurs inside a compact, convex subset of the Euclidean space, we show through an easy constructive strategy that k-capture is always possible.