Pursuit and evasion in non-convex domains of arbitrary dimension

32Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.

Abstract

Most results in pursuit-evasion games apply only to planar domains or perhaps to higher-dimensional domains which must be convex. We introduce a very general set of techniques to generalize and extend certain results on simple pursuit to non-convex domains of arbitrary dimension which satisfy a coarse curvature condition (the CAT(0) condition).

Cite

CITATION STYLE

APA

Alexander, S., Bishop, R., & Ghrist, R. (2006). Pursuit and evasion in non-convex domains of arbitrary dimension. In Robotics: Science and Systems (Vol. 2, pp. 113–120). MIT Press Journals. https://doi.org/10.15607/rss.2006.ii.015

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free