Abstract
This paper deals with the problem of computing the motions of a robot observer In order to maintain visibility of a moving target. The target moves unpredictably, and the distribution of obstacles in the workspace is known In advance. Our algorithm computes a motion strategy based on partitioning the configuration space and the workspace in non-critical regions separated by critical curves. In this work is determined the existence of a solution for a given polygon and delay.
Original language | English (US) |
---|---|
Pages | 1184-1191 |
Number of pages | 8 |
State | Published - 2003 |
Event | 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems - Las Vegas, NV, United States Duration: Oct 27 2003 → Oct 31 2003 |
Other
Other | 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems |
---|---|
Country/Territory | United States |
City | Las Vegas, NV |
Period | 10/27/03 → 10/31/03 |
ASJC Scopus subject areas
- Control and Systems Engineering
- Software
- Computer Vision and Pattern Recognition
- Computer Science Applications