Problems of visual navigation are extensively studied in contemporary robotics. In particular, we can mention different problems of visual landmarks selection, the problem of selection of a minimal set of visual landmarks, selection of partially distinguishable guards, the problem of placement of visual landmarks. In this paper, we consider one-dimensional color panoramas. Such panoramas can be used for creating fingerprints. Fingerprints give us unique identifiers for visually distinct locations by recovering statistically significant features. Fingerprints can be used as visual landmarks for the solution of various problems of mobile robot navigation. In this paper, we consider a method for automatic generation of fingerprints. In particular, we consider the bounded Post correspondence problem and applications of the problem to consensus fingerprints and topological localization. We propose an efficient approach to solve the bounded Post correspondence problem. In particular, we use an explicit reduction from the decision version of the problem to the satisfiability problem. We present the results of computational experiments for different satisfiability algorithms. In robotic experiments, we consider the average accuracy of reaching of the target point for different lengths of routes and types of fingerprints.

1.
A.
Gorbenko
,
Engineering Letters
21
,
212
217
(
2013
).
2.
D.
Colombo
,
B.
Colosimo
, and
B.
Previtali
,
Optics and Lasers in Engineering
51
,
34
46
(
2013
).
3.
K.
Gochev
,
V.
Narayanan
,
B.
Cohen
,
A.
Safonova
, and
M.
Likhachev
, “Motion Planning for Robotic Manipulators with Independent Wrist Joints,” in
2014 IEEE International Conference on Robotics and Automation
,
IEEE Press
,
Hong Kong
,
2014
, pp.
461
468
.
4.
A.
Gorbenko
, and
V.
Popov
,
Applied Mathematical Sciences
6
,
4729
4732
(
2012
).
5.
L. H.
Erickson
, and
S. M.
LaValle
, “Navigation among Visually Connected Sets of Partially Distinguishable Landmarks,” in
2012 IEEE International Conference on Robotics and Automation
,
IEEE Press
,
Saint Paul, MN
,
2012
, pp.
4829
4835
.
6.
A.
Gorbenko
, and
V.
Popov
,
Applied Mathematical Sciences
6
,
689
696
(
2012
).
7.
B.
Cartwright
, and
T.
Collett
,
Journal of Comparative Physiology A: Neuroethology, Sensory, Neural, and Behavioral Physiology
151
,
521
543
(
1983
).
8.
P.
Lamon
,
I.
Nourbakhsh
,
B.
Jensen
, and
R.
Siegwart
, “Deriving and Matching Image Fingerprint Sequences for Mobile Robot Localization,” in
2001 IEEE International Conference on Robotics and Automation
,
IEEE Press
,
Seoul, Korea
,
2001
, pp.
1609
1614
.
9.
A.
Ramisa
,
A.
Goldhoorn
,
D.
Aldavert
,
R.
Toledo
, and
R. L.
de Mantaras
,
ERCIM Newsletter
84
,
25
26
(
2011
).
10.
A.
Martinelli
,
A.
Tapus
,
K. O.
Arras
, and
R.
Siegwart
,
Springer Tracts in Advanced Robotics
15
,
442
452
(
2005
).
11.
V.
Popov
,
Applied Mechanics and Materials
365
,
946
949
(
2013
).
12.
E.
Post
,
Bull. Amer. Math. Soc.
52
,
264
268
(
1946
).
13.
P.
Bell
, and
I.
Potapov
,
Int. J. Found. Comput. S.
21
,
963
978
(
2010
).
14.
V.
Blondel
, and
V.
Canterini
,
Theory Comput. Syst.
36
,
231
245
(
2003
).
15.
J.
Cassaigne
, and
J.
Karhumäki
,
Theoret. Comput. Sci.
204
,
29
34
(
1998
).
16.
M.
Kliesch
,
D.
Gross
, and
J.
Eisert
,
Phys. Rev. Lett.
113
,
1
8
(
2014
).
17.
V.
Halava
,
M.
Hirvensalo
, and
R.
de Wolf
,
Theoret. Comput. Sci.
255
,
193
204
(
2001
).
18.
A.
Ehrenfeucht
,
J.
Karhumäki
, and
G.
Rozenberg
,
Theoret. Comput. Sci.
255
,
193
204
(
2001
).
19.
P.
Rudnicki
, and
G.
Woeginger
,
Appl. Math. Lett.
16
,
723
727
(
2003
).
20.
M.
Sipser
,
Introduction to the Theory of Computation
,
Thomson Course Technology
,
Boston
,
2005
, ISBN 0-534-95097-3.
21.
P.
Chambart
, and
P.
Schnoebelen
,
LNCS
4855
,
265
276
(
2007
).
22.
Y.
Gurevich
,
J. Comput. System Sci.
42
,
346
398
(
1991
).
23.
L.
Kari
,
G.
Gloor
, and
S.
Yu
,
Theoret. Comput. Sci.
231
,
193
203
(
2000
).
24.
L.
Cai
,
J.
Chen
,
R.
Downey
, and
M.
Fellows
,
Arch. Math. Logic
36
,
321
337
(
1997
).
25.
M.
Garey
, and
D.
Johnson
,
Computers and Intractability: A Guide to the Theory of NP-Completeness
,
W.H. Freeman and Company
,
New York
,
1990
, 2 edn., ISBN 0-716-71045-5.
26.
J.
Gu
,
P.
Purdom
,
J.
Franco
, and
B.
Wah
, “Algorithms for the Satisfiability (SAT) Problem: A Survey,” in
Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge
, edited by D. J. et al,
ACM Press
,
Providence, Rhode Island
,
1996
, pp.
19
152
.
27.
Y.
Kilani
,
M.
Bsoul
,
A.
Alsarhan
, and
A.
Al-Khasawneh
,
IJAIP
5
,
233
256
(
2013
).
28.
A.
Gorbenko
, and
V.
Popov
,
Applied Mechanics and Materials
365
,
190
193
(
2013
).
29.
V.
Popov
,
Adv. Studies Theor. Phys.
7
,
355
358
(
2013
).
30.
A.
Gorbenko
,
Int. Journal of Math. Analysis
7
,
2317
2331
(
2013
).
This content is only available via PDF.
You do not currently have access to this content.