Abstract
We address the problem of selecting sensors so as to minimize the error in estimating the position of a target. We consider a generic sensor model where the measurements can be interpreted as polygonal, convex subsets of the plane. In our model, the measurements are merged by intersecting corresponding subsets, and the measurement uncertainty corresponds to the area of the intersection. This model applies to a large class of sensors, including cameras. We present an approximation algorithm which guarantees that the resulting error in estimation is within factor 2 of the least possible error. In establishing this result, we formally prove that a constant number of sensors suffice for a good estimate - an observation made by many researchers. We demonstrate the utility of this result in an experiment where 19 cameras are used to estimate the position of a target on a known plane. In the second part of this paper, we study relaxations of the problem formulation. We consider 1) a scenario where we are given a set of possible locations of the target (instead of a single estimate) and 2) relaxations of the sensing model.
| Original language | English (US) |
|---|---|
| Article number | 1707955 |
| Pages (from-to) | 372-381 |
| Number of pages | 10 |
| Journal | IEEE Transactions on Automation Science and Engineering |
| Volume | 3 |
| Issue number | 4 |
| DOIs | |
| State | Published - Oct 2006 |
Bibliographical note
Funding Information:Manuscript received May 9, 2005; revised October 10, 2005. This work was supported in part by the National Science Foundation under Grant IIS-0438125 and a grant from RPI. A preliminary version of this paper appeared in the Proceedings of The Fourth International Symposium on Information Processing in Sensor Networks (IPSN’05) [1]. This paper was recommended for publication by Associate Editor Y. Ding and P. Ferreira upon evaluation of the reviewers’ comments.
Keywords
- Estimation
- Localization
- Sensor fusion
- Sensor selection
- Target tracking