Pair-wise Agreement Using Set-Valued Sensors*

In this paper, we study the effect that set-valued sensors have on coordination algorithms. In particular, we investigate the two-agent rendezvous problem with severely limited sensing. We characterize conditions under which a agent can locate a stationary target when the sensing modality is probabilistic and set-valued. We generalize this to the case where a mobile agent is locating the target and show that the location of the stationary agent can be approximated up to a set of measure zero.