Translator Disclaimer
17 May 2006 A sparse sampling planner for sensor resource management
Author Affiliations +
The goal of sensor resource management (SRM) is to allocate resources appropriately in order to gain as much information as possible about a system. We introduce a centralized non-myopic planning algorithm, C-SPLAN, that uses sparse sampling to estimate the value of resource assignments. Sparse sampling is related to Monte Carlo simulation. In the SRM problem we consider, our network of sensors observes a set of tracks; each sensor can be set to operate in one of several modes and/or viewing geometries. Each mode incurs a different cost and provides different information about the tracks. Each track has a kinematic state and is of a certain class; the sensors can observe either or both of these, depending on their mode of operation. The goal in this problem is to maximize the overall rate of information gain, i.e. rate of improvement in kinematic tracking and classification accuracy of all tracks in the Area of Interest. The rate is defined by several metrics with the cost of the sensor mode being the primary factor. We compare C-SPLAN's performance on several tracking and target identification problems to that of other algorithms.
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Matthew Rudary, Deepak Khosla, James Guillochon, P. Alex Dow, and Barbara Blyth "A sparse sampling planner for sensor resource management", Proc. SPIE 6235, Signal Processing, Sensor Fusion, and Target Recognition XV, 62350A (17 May 2006);

Back to Top