Aggregation-based approaches to honey-pot searching with local sensory information

Bhaskar DasGuota, João P. Hespanha, Eduardo Sontag

Research output: Contribution to journalConference articlepeer-review

2 Scopus citations


We investigate the problem of searching for a hidden target in a bounded region by an autonomous agent that is only able to use limited local sensory information. We propose an aggregation-based approach to solve this problem, in which the continuous search space is partitioned into a finite collection of regions on which we define a discrete search problem. A solution to the original problem is then obtained through a refinement procedure that lifts the discrete path into a continuous one. The resulting solution is in general not optimal but one can construct bounds to gauge the cost penalty incurred.

Original languageEnglish (US)
Pages (from-to)1202-1207
Number of pages6
JournalProceedings of the American Control Conference
StatePublished - 2004
EventProceedings of the 2004 American Control Conference (AAC) - Boston, MA, United States
Duration: Jun 30 2004Jul 2 2004

ASJC Scopus subject areas

  • Electrical and Electronic Engineering


Dive into the research topics of 'Aggregation-based approaches to honey-pot searching with local sensory information'. Together they form a unique fingerprint.

Cite this