Please use this identifier to cite or link to this item:
Title: ORB-based optimal lost robot self-recovery
Authors: Soo, Danny Hong Kit
Keywords: DRNTU::Engineering::Electrical and electronic engineering
Issue Date: 2017
Abstract: Due to various reasons, an autonomous mobile robot may deviate from its planned trajectory. If the robot deviates beyond its knowledge of the environment, it is essentially ‘lost’. To complete its programmed task, it is thus important for the robot to be able to perform ‘lost-recovery’, which is to re-orientate itself back within the perimeters of a known environment. The key idea behind lost-recovery is the concept of simultaneous localization and mapping (SLAM), with place recognition being our area of interest. Existing place recognition techniques are based mostly on SIFT or SURF, which are highly accurate but computationally intensive. This report will explore the integration of a recently-developed descriptor, ORB (Oriented Fast and Rotated Brief), and the DBoW2 hierarchical tree structure to create an algorithm which guides a lost robot back to its programmed path through visual means. This report will start with a brief introduction about the lost robot problem, followed by a literature review on some of the existing work done on lost robot recovery and place recognition. Subsequent chapters will discuss in details the method proposed by the author and the results obtained from simulations in different environments. The report will conclude with analysis of results and suggestions for future work.
Schools: School of Electrical and Electronic Engineering 
Organisations: A*STAR Institute for Infocomm Research
Rights: Nanyang Technological University
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:EEE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
  Restricted Access
8.16 MBAdobe PDFView/Open

Page view(s)

Updated on Jun 20, 2024


Updated on Jun 20, 2024

Google ScholarTM


Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.