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).
CITATION STYLE
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
Mendeley helps you to discover research relevant for your work.