Adaptive search for sparse dynamic targets

Abstract

Abstract-We consider the problem of energy constrained and noise-limited search for targets that are sparsely distributed over a large area. We propose a multiple-stage search algorithm that accounts for complex time-varying target behavior such as transitions among neighboring cells and varying target amplitudes. This work extends the adaptive resource allocation policy (ARAP) introduced in [Bashan et al, 2008] to policies with T 2 stages. The proposed search strategy is driven by minimization of a surrogate function for energy constrained mean-squared error within locations containing targets. Exact optimization of the multi-stage objective function is infeasible, but myopic optimization yields a closed-form solution. We extend the myopic solution with non-myopic considerations that save a percentage of resources for exploring the scene at large. Empirical evidence suggests that the non-myopic policy performs significantly better than the myopic solution in terms of estimation error, probability of detection, and robustness to model mismatch. Moreover, the provided search policy has low computational complexity compared to state-of-the-art dynamic programming solutions.

Resource-Constrained Adaptive Search and Tracking for Sparse Dynamic Targets

“…Thus, the offline rollout policy requires O(T T 0 ) Monte Carlo simulations to determine policies for {κ(τ )} T τ =T0+1 . This improves upon the approach [18] where a nested optimization procedure (aka, the "nested policy") required O(T 2 ) calculations. In our experiments (not shown), the offline rollout policy performed just as well as the nested policy, though with reduced computational complexity.…”