Scheduling Binary Proximity Sensors for Robust Target Tracking

This paper describes two scheduling algorithms designed to improve target tracking performance in a distributed network of binary proximity sensors. Tracking with such sensors is a difficult problem as they only transmit a single binary digit regarding the presence of a target. In addition, the operational status of these sensors may not be accurately known. This paper describes extensions to a Gaussian mixture-based tracking algorithm which aid in addressing these problems. These extensions reduce computational complexity and improve accuracy by scheduling status queries to selected sensors