On achievable accuracy for range-finder localization

Abstract

The covariance of every unbiased estimator is bounded by the Cramer-Rao lower bound, which is the inverse of Fisher's information matrix. This paper shows that, for the case of localization with range-finders, Fisher's matrix is a function of the expected readings and of the orientation of the environment's surfaces at the sensed points. The matrix also offers a mathematically sound way to characterize under-constrained situations as those for which it is singular: in those cases the kernel describes the direction of maximum uncertainty. This paper also introduces a simple model of unstructured environments for which the Cramer-Rao bound is a function of two statistics of the shape of the environment: the average radius and a measure of the irregularity of the surfaces. Although this model is not valid for all environments, it allows for some interesting qualitative considerations. As an experimental validation, this paper reports simulations comparing the bound with the actual performance of the ICP (iterative closest/corresponding point) algorithm. Finally, it is discussed the difficulty in extending these results to find a lower bound for accuracy in scan matching and SLAM.