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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
