Linear-time robot localization and pose tracking using matching signatures

  • Kar A
  • 2


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.


Abstract: A feature-based method for global localization of mobile robot using a concept of matching signatures is presented. A group of geometric features, their geometric constraints invariant to frame transform, and location dependent constraints, together are utilized in defining signature of a feature. Plausible global poses are found out by matching signatures of observed features with signatures of global map features. The concept of matching signatures is so developed that the proposed method provides a very efficient solution for global localization. Worst-case complexity of the method for estimating and verifying global poses is linear with the size of global reference map. It will also be shown that with the approach of random sampling the proposed algorithm becomes linear with both the size of global map and number of observed features. In order to avoid pose ambiguity, simultaneous tracking of multiple pose hypotheses staying within the same framework of the proposed method is also addressed. Results obtained from simulation as well as from real world experiment demonstrate the performance and effectiveness of the method. [Copyright &y& Elsevier]

Author-supplied keywords

  • COMPUTATIONAL complexity
  • CONSTRAINT satisfaction (Artificial intelligence)
  • DIGITAL signatures
  • Data association
  • Feature-based navigation
  • Global localization
  • LINEAR systems
  • MATCHING theory
  • Multi-hypothesis tracking
  • SLAM
  • Signature matching

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Asim Kar

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free