### Abstract

We present an O(n log^{1+ε}n)-time algorithm for computing the optimal robot motion that maintains line-of-sight visibility between a target moving inside a polygon with n vertices which may contain holes. The motion is optimal for the tracking robot (the observer) in the sense that the target either remains visible for the longest possible time, or it is captured by the observer in the minimum time when feasible. Thus, the algorithm maximizes the minimum time-to-escape. Our algorithm assumes that the target moves along a known path. Thus, it is an off-line algorithm. Our theoretical results for the algorithm's runtime assume that the target is moving along a shortest path from its source to its destination. This assumption, however is not required to prove the optimality of the computed solution, hence the algorithm remains correct for the general case.

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

Pages (from-to) | 3789-3796 |

Number of pages | 8 |

Journal | Proceedings - IEEE International Conference on Robotics and Automation |

Volume | 3 |

State | Published - Dec 9 2003 |

Event | 2003 IEEE International Conference on Robotics and Automation - Taipei, Taiwan, Province of China Duration: Sep 14 2003 → Sep 19 2003 |

### Fingerprint

### ASJC Scopus subject areas

- Software
- Control and Systems Engineering
- Artificial Intelligence
- Electrical and Electronic Engineering

### Cite this

*Proceedings - IEEE International Conference on Robotics and Automation*,

*3*, 3789-3796.