slides
Imagine a collection of entities moving unpredictably at some bounded speed. Information about entity locations can be maintained by queries, at most one per unit of time, between which location uncertainty grows. Our goal is to minimize global measures of potential congestion defined in terms of the intersection graph of their associated uncertainty regions. As a step towards this larger goal, we study the problem of minimizing the total degree of static entities located in $\mathbb R^1$.