Analysis of and heuristics for sensor configuration in a simple target localization problem

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

1 Scopus citations

Abstract

We investigate Bayesian methods and heuristics for management of a configurable sensor in a simple target localization problem. A target is located in one of M cells. A sensor, characterized by probabilities of correct detection and false alarm, repeatedly chooses a cell to interrogate; the resulting observations are used to update the posterior probability distribution of target location. Interrogations are repeated either a fixed number of times or until the probability of error drops below a pre-selected threshold. The Bayes optimal solution is exponentially complex, motivating the use of heuristics. Four heuristic rules are characterized using Monte Carlo simulation. Of these heuristics, choosing the most probable cell minimizes the number of observations, and the myopic Bayes optimal rule minimizes the probability of error.

Original languageEnglish (US)
Title of host publicationConference Record of the Asilomar Conference on Signals, Systems and Computers
EditorsM.B. Matthews
Pages1391-1395
Number of pages5
Volume2
StatePublished - 2001
Event35th Asilomar Conference on Signals, Systems and Computers - Pacific Grove, CA, United States
Duration: Nov 4 2001Nov 7 2001

Other

Other35th Asilomar Conference on Signals, Systems and Computers
CountryUnited States
CityPacific Grove, CA
Period11/4/0111/7/01

ASJC Scopus subject areas

  • Hardware and Architecture
  • Signal Processing
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Analysis of and heuristics for sensor configuration in a simple target localization problem'. Together they form a unique fingerprint.

Cite this