The problem of fingerprints selection for topological localization

Abstract

Visual navigation is extensively used in contemporary robotics. In particular, we can mention different systems of visual landmarks. In this paper, we consider one-dimensional color panoramas. Panoramas can be used for creating fingerprints. Fingerprints give us unique identifiers for visually distinct locations by recovering statistically significant features. Also, it can be used as visual landmarks for mobile robot navigation. In this paper, we consider a method for automatic generation of fingerprints. Since a fingerprint is a circular string, different string-matching algorithms can be used for selection of fingerprints. In particular, we consider the problem of finding the consensus of circular strings under the Hamming distance metric. We propose an approach to solve the problem. In particular, we consider the center string problem, the center circular string problem, and the center circular string with fixed letters problem. We obtain an explicit reduction from the center circular string problem to the satisfiability problem. We propose a genetic algorithm for solution of the center circular string problem. Also, we propose a genetic algorithm for the prediction the effectiveness of the use of special algorithm for four circular strings.