{'fraction_non_alphanumeric': 0.012027491408934709, 'fraction_numerical': 0.0, 'mean_word_length': 5.297297297297297, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Adaptive sensing and target tracking of a simple point target with online measurement selection

In previous work we considered the problem of estimating target location parameters using an adaptive sensing paradigm, wherein one attempts to choose the most informative measurement from a set of possibilities characterized by a linear measurement matrix. Here we extend that work to target tracking. At each step in a discrete-time Bayesian filter, a measurement matrix is chosen to illuminate in some near-optimal manner the space of target response vectors in accordance with the prior distribution on the target position. Two methods are proposed. One is based on approximating the manifold of array response vectors as a Euclidean space, and minimizing the Bayesian Cramer-Rao bound on the unknown parameter. The second chooses the rows of the measurement matrix equal to target response vectors at different values of parameter, distributed according to the square root of the prior probability density function for the target location. Performance improvements relative to nonadaptive target tracking methods are quantified for a small number of simulations.