### Abstract

This paper addresses the problem of planning the motion of one or more pursuers in a polygonal environment to eventually “see” an evader that is unpredictable, has unknown initial position, and is capable of moving arbitrarily fast. This problem was first introduced by Suzuki and Yamashita. Our study of this problem is motivated in part by robotics applications, such as surveillance with a mobile robot equipped with a camera that must find a moving target in a cluttered workspace. A few bounds are introduced, and a complete algorithm is presented for computing a successful motion strategy for a single pursuer. For simply-connected free spaces, it is shown that the minimum number of pursuers required is θ(lg n). For multiply-connected free spaces, the bound is θ(√h+lg n) pursuers for a polygon that has n edges and h holes. A set of problems that are solvable by a single pursuer and require a linear number of recontaminations is shown. The complete algorithm searches a finite cell complex that is constructed on the basis of critical information changes. It has been implemented and computed examples are shown.

Original language | English (US) |
---|---|

Title of host publication | Algorithms and Data Structures - 5th International Workshop, WADS 1997, Proceedings |

Editors | Andrew Rau-Chaplin, Frank Dehne, Jorg-Rudiger Sack, Roberto Tamassia |

Publisher | Springer-Verlag |

Pages | 17-30 |

Number of pages | 14 |

ISBN (Print) | 3540633073, 9783540633075 |

State | Published - Jan 1 1997 |

Externally published | Yes |

Event | 5th International Workshop on Algorithms and Data Structures, WADS 1997 - Halifax, Canada Duration: Aug 6 1997 → Aug 8 1997 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 1272 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 5th International Workshop on Algorithms and Data Structures, WADS 1997 |
---|---|

Country | Canada |

City | Halifax |

Period | 8/6/97 → 8/8/97 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'Visibility-based pursuit-evasion in a polygonal environment'. Together they form a unique fingerprint.

## Cite this

*Algorithms and Data Structures - 5th International Workshop, WADS 1997, Proceedings*(pp. 17-30). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1272). Springer-Verlag.