Abstract
We introduce simple tools from geometric convexity to analyze capture-type (or "Lion and Man'') pursuit problems in unbounded domains. The main result is a necessary and sufficient condition for eventual capture in equal-speed discrete-time multi-pursuer capture games on convex Euclidean domains of arbitrary dimension and shape. This condition is presented in terms of recession sets in unit tangent spheres. The chief difficulties lie in utilizing the boundary of the domain as a constraint on the evader's escape route. We also show that these convex-geometric techniques provide sufficient criteria for pursuit problems in non-convex domains with a convex decomposition.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
