Pursuit and evasion in non-convex domains of arbitrary dimensions

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). Download: Bibtex: @INPROCEEDINGS{ Alexander-RSS-06, AUTHOR = {S. Alexander and R. Bihsop and R. Ghrist}, TITLE = {Pursuit and evasion in non-convex domains of arbitrary dimensions}, BOOKTITLE = {Proceedings of Robotics: Science and Systems}, YEAR = {2006}, ADDRESS = {Philadelphia, USA}, MONTH = {August}, DOI = {10.15607/RSS.2006.II.015} }