English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We establish fundamental limits of tracking a moving target over the unitcube under the framework of 20 questions with measurement-dependent noise. Inthis problem, there is an oracle who knows the instantaneous location of atarget. Our task is to query the oracle as few times as possible to accuratelyestimate the trajectory of the moving target, whose initial location andvelocity is \emph{unknown}. We study the case where the oracle's answer to eachquery is corrupted by random noise with query-dependent discrete distribution.In our formulation, the performance criterion is the resolution, which isdefined as the maximal absolute value between the true location and estimatedlocation at each discrete time during the searching process. We are interestedin the minimal resolution of any non-adaptive searching procedure with a finitenumber of queries and derive approximations to this optimal resolution via thesecond-order asymptotic analysis.

Resolution Limits of 20 Questions Search Strategies for Moving Targets