We consider problems of localization, disambiguation, and mapping in a domain filled with signals-of-opportunity generated by transmitters. One or more (static or mobile) receivers utilize these signals and from them characterize the domain, localize, disambiguate, etc. The tools we develop are topological in nature, and rely on interpreting the problem as one of embedding the domain into a sufficiently high-dimensional space of signals via a signal profile function. Varying kinds of signal processing (TOA, TDOA, DOA, etc.) and discretization are addressed. Finally, we describe experiments that demonstrate the feasibility of these ideas in practice.
An assignment to a sheaf is the choice of a local section from each open set in the sheaf's base space, without regard to how these local sections are related to one another. This article explains that the consistency radius --- which quantifies the agreement between overlapping local sections in the assignment --- is a continuous map. When thresholded, the consistency radius produces the consistency filtration, which is a filtration of open covers. This article shows that the consistency filtration is a functor that transforms the structure of the sheaf and assignment into a nested set of covers in a structure-preserving way. Furthermore, this article shows that consistency filtration is robust to perturbations, establishing its validity for arbitrarily thresholded, noisy data.
1 May 2019 in Notices of the American Mathematical Society
Fox hunting is a sport in which individuals race to locate a hidden radio transmitter on a known frequency. Michael Robinson explains how to model a collection of sensors that can be combined into a sheaf model; how to locate the fox transmitter; and how to determine if there are actually multiple transmitters.