Building the Panoramic Image for Mobile Robot Localization

Abstract:

Visual landmarks are extensively used in contemporary robotics. There are a large number of different systems of visual landmarks. In particular, fingerprints give us unique identifiers for visually distinct locations by recovering statistically significant features. Therefore, fingerprints can be used as visual landmarks for mobile robot navigation. To create fingerprints we need one-dimensional color panoramas of high quality. In this paper, we consider a method for building the panoramic image using string matching algorithms. In particular, we propose the shortest common ordered supersequence problem.

• Periodical: Applied Mechanics and Materials (Volumes 365-366)
• Pages: 967-970
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.365-366.967
• Online since: August 2013
• Authors: Vladimir Popov, Anna Gorbenko
• Keywords: Fingerprint, Mobile Robot, String Matching, Visual Landmarks

References

[1] C. Gonzalez-Buesa, J. Campos, Solving the mobile robot localization problem using string matching algorithms, in: IEEE/RSJ International Conference on Intelligent Robots and Systems, IEEE Press, 2004, pp.2475-2480.

DOI: 10.1109/iros.2004.1389780

[2] P. Lamon, I. Nourbakhsh, B. Jensen, R. Siegwart, Deriving and matching image fingerprint sequences for mobile robot localization, in: IEEE International Conference on Robotics and Automation, IEEE Press, 2001, pp.1609-1614.

DOI: 10.1109/robot.2001.932841

[3] Image Composite Editor, http: /research. microsoft. com/en-us/um/redmond/groups/ivm/ice.

[4] A. Argyros, K. Bekris, S. Orphanoudakis, L. Kavraki, Robot Homing by Exploiting Panoramic Vision, Auton. Robot. 19 (2005) 7-25.

DOI: 10.1007/s10514-005-0603-7

[5] A. Oikonomopoulos, I. Patras, M. Pantic, N. Paragios, Trajectory-based representation of human actions, in: Proceedings of ICMI and IJCAI International Conference on Artifical Intelligence for Human Computing, Springer, 2007, pp.133-154.

DOI: 10.1007/978-3-540-72348-6_7

[6] A. Gorbenko, V. Popov, Self-Learning of Robots and the Model of Hamiltonian Path with Fixed Number of Color Repetitions for Systems of Scenarios Creation, Advanced Materials Research 683 (2013) 909-912.

DOI: 10.4028/www.scientific.net/amr.683.909

[7] A. Gorbenko, V. Popov, Programming for Modular Reconfigurable Robots, Programming and Computer Software 38 (2012) 13-23.

DOI: 10.1134/s0361768812010033

[8] V. Popov, Multiple genome rearrangement by swaps and by element duplications, Theor. Comput. Sci. 385 (2007) 115-126.

DOI: 10.1016/j.tcs.2007.05.029

[9] V. Popov, Computational complexity of problems related to DNA sequencing by hybridization, Dokl. Math. 72 (2005) 642-644.

[10] V. Popov, The approximate period problem for DNA alphabet, Theor. Comput. Sci. 304 (2003) 443-447.

[11] A. Gorbenko, V. Popov, The set of parameterized k-covers problem, Theor. Comput. Sci. 423 (2012) 19-24.

[12] J. Shi, C. Tomasi, Good Features to Track, in: IEEE Conference on Computer Vision and Pattern Recognition, IEEE Press, 1994, pp.593-600.

DOI: 10.1109/cvpr.1994.323794

[13] A. Gorbenko, V. Popov, A Real-World Experiments Setup for Investigations of the Problem of Visual Landmarks Selection for Mobile Robots, Appl. Math. Sci. 6 (2012) 4767-4771.