The sensor selection problem for bounded uncertainty sensing models

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. 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 a 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. In the second part of the paper, we study the scenario where the target's position is given by an uncertainty region and present algorithms for both probabilistic and online versions of this problem.

[1]  Jürgen Teich,et al.  Minimal enclosing parallelogram with application , 1995, SCG '95.

[2]  Sonia Martínez,et al.  Coverage control for mobile sensing networks , 2002, IEEE Transactions on Robotics and Automation.

[3]  Vijay Kumar,et al.  Cooperative localization and control for multi-robot manipulation , 2001, Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems. Expanding the Societal Role of Robotics in the the Next Millennium (Cat. No.01CH37180).

[4]  Gaurav S. Sukhatme,et al.  Cooperative Relative Localization for Mobile Robot Teams: An Ego-Centric Approach , 2003 .

[5]  Sebastian Thrun,et al.  A Probabilistic On-Line Mapping Algorithm for Teams of Mobile Robots , 2001, Int. J. Robotics Res..

[6]  Camillo J. Taylor,et al.  A bounded uncertainty approach to multi-robot localization , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[7]  Hugh Durrant-Whyte,et al.  Data Fusion and Sensor Management: A Decentralized Information-Theoretic Approach , 1995 .

[8]  Feng Zhao,et al.  Collaborative In-Network Processing for Target Tracking , 2003, EURASIP J. Adv. Signal Process..

[9]  Leonidas J. Guibas,et al.  Collaborative signal and information processing: an information-directed approach , 2003 .

[10]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[11]  David C. Moore,et al.  Robust distributed network localization with noisy range measurements , 2004, SenSys '04.

[12]  L. El Ghaoui,et al.  Convex position estimation in wireless sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[13]  Zack J. Butler,et al.  Tracking a moving object with a binary sensor network , 2003, SenSys '03.

[14]  Sebastian Thrun,et al.  Robotic mapping: a survey , 2003 .

[15]  Peter Kovesi,et al.  MATLAB Functions for Computer Vision and Image Analysis , 2004 .

[16]  Sanjeev Khanna,et al.  Target tracking with distributed sensors: the focus of attention problem , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[17]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[18]  John W. Fisher,et al.  Maximum Mutual Information Principle for Dynamic Sensor Query Problems , 2003, IPSN.

[19]  Camillo J. Taylor,et al.  Dynamic Sensor Planning and Control for Optimally Tracking Targets , 2003, Int. J. Robotics Res..

[20]  G. Pottie,et al.  Entropy-based sensor selection heuristic for target localization , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[21]  Jie Liu,et al.  Distributed state representation for tracking problems in sensor networks , 2004, IPSN '04.