Abstract
In this paper we propose an approach to solve the problem of finding an object in a polygon which may contain holes. We define an optimal solution as the route that minimizes the expected time it takes to find said object. The object search problem is shown to be NP-hard by reduction, therefore, we propose the heuristic of an utility function, defined as the ratio of a gain over a cost and an greedy algorithm in a reduced search space that is able to explore several steps ahead without incurring in too high a computational cost. This approach was implemented and simulation results are shown.
| Original language | English (US) |
|---|---|
| Pages | 1153-1158 |
| Number of pages | 6 |
| 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
Fingerprint
Dive into the research topics of 'An Efficient Strategy for Rapidly Finding an Object in a Polygonal World'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS