Skip to main content
Log in

Accuracy bounds and optimal computation of robot localization

  • Original papers
  • Published:
Machine Vision and Applications Aims and scope Submit manuscript

Abstract.

We present an optimal method for estimating the current location of a mobile robot by matching an image of the scene taken by the robot with a model of the known environment. We first derive a theoretical accuracy bound and then give a computational scheme that can attain that bound, which can be viewed as describing the probability distribution of the current location. Using real images, we demonstrate that our method is superior to the naive least-squares method. We also confirm the theoretical predictions of our theory by applying the bootstrap procedure.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: 17 March 1998 / Accepted: 7 April 2001

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kanatani, K., Ohta, N. Accuracy bounds and optimal computation of robot localization. Machine Vision and Applications 13, 51–60 (2001). https://doi.org/10.1007/PL00013274

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00013274

Navigation