# Resolution Limits of Non-Adaptive 20 Questions Search for a Moving Target

arXiv: https://arxiv.org/abs/2206.08884 · HTML: https://mlsanity.com/paper/2206.08884/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 6 of its 35 references that are in the map.
- First posted on arXiv 14 Jun 2022.

## Builds on (most cited first, 6 of 6)

- [Active Learning and CSI Acquisition for mmWave Initial Alignment](https://mlsanity.com/paper/1812.07722/) (2018)
- [Fixed-horizon Active Hypothesis Testing](https://mlsanity.com/paper/1911.06912/) (2019)
- [On Decentralized Estimation with Active Queries](https://mlsanity.com/paper/1312.7847/) (2013)
- [Non-Adaptive Policies for 20 Questions Target Localization](https://mlsanity.com/paper/1504.05996/) (2015)
- [Improved Target Acquisition Rates with Feedback Codes](https://mlsanity.com/paper/1712.05865/) (2017)
- [Resolution Limits of 20 Questions Search Strategies for Moving Targets](https://mlsanity.com/paper/2103.08097/) (2021)

## Abstract (arXiv)

Using the 20 questions estimation framework with query-dependent noise, we study non-adaptive search strategies for a moving target over the unit cube with unknown initial location and velocities under a piecewise constant velocity model. In this search problem, there is an oracle who knows the instantaneous location of the target at any time. Our task is to query the oracle as few times as possible to accurately estimate the location of the target at any specified time. We first study the case where the oracle's answer to each query is corrupted by discrete noise and then generalize our results to the case of additive white Gaussian noise. In our formulation, the performance criterion is the resolution, which is defined as the maximal L_∞ distance between the true locations and estimated locations. We characterize the minimal resolution of an optimal non-adaptive query procedure with a finite number of queries by deriving non-asymptotic and asymptotic bounds. Our bounds are tight in the first-order asymptotic sense when the number of queries satisfies a certain condition and our bounds are tight in the stronger second-order asymptotic sense when the target moves with a constant velocity. To prove our results, we relate the current problem to channel coding, borrow ideas from finite blocklength information theory and construct bounds on the number of possible quantized target trajectories.