Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/ICIF.2006.301714 | 2006 9TH INTERNATIONAL CONFERENCE ON INFORMATION FUSION, VOLS 1-4 |
Keywords | Field | DocType |
sensor networks, sensor scheduling, target tracking | Proximity sensor,Scheduling (computing),Computer science,Real-time computing,Gaussian,Artificial intelligence,Gaussian process,Wireless sensor network,Machine learning,Binary number,Computational complexity theory | Conference |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Barbara F. La Scala | 1 | 54 | 11.26 |