| Computational Complexities of Honey-pot Searching with Local Sensory Information (2003) | |||||||||||||||
Abstract | |||||||||||||||
| In this paper we investigate the problem of searching for a hidden target in a bounded region of the plane, by an autonomous robot which is only able to use limited local sensory information. We formalize a discrete version of the problem as a "reward-collecting" path problem and provide e#cient approximation algorithms for various cases. | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||