Resource-Constrained Adaptive Search for Sparse Multi-Class Targets with Varying Importance

In sparse target inference problems it has been shown that significant gains can be achieved by adaptive sensing using convex criteria. We generalize previous work on adaptive sensing to (a) include multiple classes of targets with different levels of importance and (b) accommodate multiple sensor models. New optimization policies are developed to allocate a limited resource budget to simultaneously locate, classify and estimate a sparse number of targets embedded in a large space. Upper and lower bounds on the performance of the proposed policies are derived by analyzing a baseline policy, which allocates resources uniformly across the scene, and an oracle policy which has a priori knowledge of the target locations/classes. These bounds quantify analytically the potential benefit of adaptive sensing as a function of target frequency and importance. Numerical results indicate that the proposed policies perform close to the oracle bound when signal quality is sufficiently high (e.g. performance within 3 dB for SNR above 15 dB). Moreover, the proposed policies improve on previous policies in terms of reducing estimation error, reducing misclassification probability, and increasing expected return. To account for sensors with different levels of agility, three sensor models are considered: global adaptive (GA), which can allocate different amounts of resource to each location in the space; global uniform (GU), which can Gregory Newstadt is with Google Pittsburgh, Pittsburgh, PA 15206, E-mail: [email protected] Beipeng Mu and Jonathan How are with Dept. of Aeronautics and Astronautics, Massachusetts Institute of Technology, Cambridge, MA 02139, E-mail: ({mubp},{jhow})@mit.edu Dennis Wei is with the Thomas J. Watson Research Center, IBM Research, Yorktown Heights, NY 10598, E-mail: [email protected]. Alfred Hero is with the Dept. of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, E-mail: [email protected]. The research in this paper was partially supported by Army Research Office MURI grant number W911NF-11-1-0391. 2 allocate resources uniformly across the scene; and local adaptive (LA), which can allocate fixed units to a subset of locations. Policies that use a mixture of GU and LA sensors are shown to perform similarly to those that use GA sensors while being more easily implementable.