Michael K. Schneider

Farsighted sensor management strategies for move/stop tracking

We consider the sensor management problem arising in using a multi-mode sensor to track moving and stopped targets. The sensor management problem is to determine what measurements to take in time so as to optimize the utility of the collected data. Finding the best sequence of measurements is a hard combinatorial problem due to many factors, including the large number of possible sensor actions and the complexity of the dynamics. The complexity of the dynamics is due in part to the sensor dwell-time depending on the sensor mode, targets randomly starting and stopping, and the uncertainty in the sensor detection process. For such a sensor management problem, we propose a novel, computationally efficient, farsighted algorithm based on an approximate dynamic programming methodology. The algorithms complexity is polynomial in the number of targets. We evaluate this algorithm against a myopic algorithm optimizing an information-theoretic scoring criterion. Our simulation results indicate that the farsighted algorithm performs better with respect to the average time the track error is below a specified goal value.

Farsighted sensor management for feature-aided tracking

We consider the sensor management problem arising in air-to-ground tracking of moving targets. The sensing-tracking system includes a radar and a feature-aided tracker. The radar collects target-signature data in high-resolution-radar (HRR) mode. The tracker is using the collected HRR-signature data to create and maintain target-track identification information. More specifically, the tracker is learning target-track profiles from the collected signature data, and is using these profiles to resolve the potential report-to-track or track-to-track association ambiguities. In this paper, we focus on the management of the HRR-signature data collection. Specifically, the sensor management problem is to determine where to collect signature data on targets in time so as to optimize the utility of the collected data. As with other sensor management problems, determining the optimal data collection is a hard combinatorial problem due to many factors including the large number of possible sensor actions and the complexity of the dynamics. The complexity of the dynamics stems in part from the presence of the sensor slew time. A distinguishing feature of the sensor management problem considered here is that the HRR-signature data collected during the learning phase has no immediate value. To optimize the data collections, a sensor manager must look sufficiently far into the future to adequately trade-off alternative plans. Here, we propose some farsighted algorithms, and evaluate them against a sequential scanning and a greedy algorithm. We present our simulation results obtained by applying these algorithms to a problem of managing a single sensor providing HRR-signature data.