Efficient Employment of Adaptive Sensor
Abstract
We consider a sensor that is subject to false-positive and false-negative errors. The sensor searches for stationary threat objects such as ballistic missile launchers or improvised explosive devices. The objects are located in a certain area of interest, which is divided into area-cells. The area-cells are defined such that each one of them may contain, at most, one threat object. The task of the sensor is to determine if an area-cell contains a threat object, and the objective of the searcher is to maximize the number of correctly determined area-cells. Since definitive identification of a threat object, and subsequent handling of that threat, are done by a limited number of available ground combat units, the correct determination of an area-cell is crucial for better allocating and directing these scarce resources. We develop an algorithm, rooted in large deviations theory and stochastic approximation theory, that leads to the optimal search effort. The computed allocation maximizes the expected number correctly determined area-cells as the number of available looks for searching becomes large.
Document Details
- Document Type
- Technical Report
- Publication Date
- Dec 01, 2008
- Accession Number
- ADA494069
Entities
People
- Lee K. Kiang
Organizations
- Naval Postgraduate School