We define information gathering as the task of both deciding what sensor data to gather and process, and fusing those observations into a common representation. In most such systems there is a tradeoff between the complexity of a computational technique and its efficiency at gathering and using information. In some cases, it turns out that computationally simple technique, though it may make poor use of information, outperforms a, more accurate but, more complex technique simply because of its ability to process more observations in less time. Naturally, the correct tradeoff between speed and complexity varies from situation to situation. In this paper, we discuss and compare the grid-based techniques developed in our previous work, classic minimum mean-square estimation techniques (MMSE), and a, modification of MMSE which is robust, to nonlinear systems and system description errors with respect to their efficiency at using sensor information. We then discuss the ability of these techniques to improve their performance by choosing favorable sensor observations, and what effect this has on their overall complexity/efficiency tradeoff.
[1]
E. L. Lehmann,et al.
Theory of point estimation
,
1950
.
[2]
A. J. Westlake.
Introduction to Linear Models and the Design and Analysis of Experiments
,
1969
.
[3]
Walter Jacobs,et al.
Robot Decisions Based on Maximizing Utility
,
1973,
IJCAI.
[4]
W. J. Studden,et al.
Theory Of Optimal Experiments
,
1972
.
[5]
J. Berger.
Statistical Decision Theory and Bayesian Analysis
,
1988
.
[6]
I. Coles.
Decision Analysis For An Experimental Robot With Unreliable Sensors
,
1975,
IJCAI.
[7]
Gregory D. Hager,et al.
Estimation procedures for robust sensor control
,
1987,
Int. J. Approx. Reason..
[8]
Alec Cameron.
Optimal tactile sensor placement
,
1989,
Proceedings, 1989 International Conference on Robotics and Automation.
[9]
Arthur Gelb,et al.
Applied Optimal Estimation
,
1974
.