Universal scheme for optimal search and stop

Sirin Nitinawarat, Venugopal V. Veeravalli

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The problem of universal search and stop using an adaptive search policy is considered. When the target location is searched, the observation is distributed according to the target distribution, otherwise it is distributed according to the absence distribution. A universal sequential scheme for search and stop is proposed using only the knowledge of the absence distribution, and its asymptotic performance is analyzed. The universal test is shown to yield a vanishing error probability, and to achieve the optimal reliability when the target is present, universally for every target distribution. Consequently, it is established that the knowledge of the target distribution is only useful for improving the reliability for detecting a missing target. It is also shown that a multiplicative gain for the search reliability equal to the number of searched locations is achieved by allowing adaptivity in the search.

Original languageEnglish (US)
Title of host publication2015 Information Theory and Applications Workshop, ITA 2015 - Conference Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages322-328
Number of pages7
ISBN (Electronic)9781479971954
DOIs
StatePublished - Oct 27 2015
EventInformation Theory and Applications Workshop, ITA 2015 - San Diego, United States
Duration: Feb 1 2015Feb 6 2015

Publication series

Name2015 Information Theory and Applications Workshop, ITA 2015 - Conference Proceedings

Other

OtherInformation Theory and Applications Workshop, ITA 2015
Country/TerritoryUnited States
CitySan Diego
Period2/1/152/6/15

Keywords

  • Computational modeling
  • Error probability
  • Joints
  • Reliability
  • Search problems
  • Testing
  • Yttrium

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

Fingerprint

Dive into the research topics of 'Universal scheme for optimal search and stop'. Together they form a unique fingerprint.

Cite this