Por favor, use este identificador para citar o enlazar a este item: http://hdl.handle.net/10261/235670
COMPARTIR / EXPORTAR:
logo share SHARE BASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE

Invitar a revisión por pares abierta
Título

Robust Navigation for Industrial Service Robots

AutorDeray, Jeremie
DirectorSolà, Joan CSIC; Andrade-Cetto, Juan CSIC ORCID
Fecha de publicación29-sep-2020
EditorUniversidad Politécnica de Cataluña
CSIC-UPC - Instituto de Robótica e Informática Industrial (IRII)
ResumenAs one of the fundamental problems of robotics, the different challenges that constitute navigation have been studied for decades. Robust, reliable and safe navigation is a key factor for the enablement of higher level functionalities for robots that are going to evolve around humans on a daily basis. Throughout the present thesis, we tackle the problem of navigation for robotic industrial mobile-bases. We identify its components and analyze their respective challenges in order to address them. The research work presented here ultimately aims at improving the overall quality of the navigation stack of a commercially available industrial mobile-base. To introduce and survey the overall problem we first break down the navigation framework into clearly identified smaller problems. We examine the problem of simultaneously mapping the environment and localizing the robot in it by exploring the state of the art. Doing so we recall and detail the mathematical grounding of the Simultaneous Localization and Mapping (SLAM) problem. We then review the problem of planning the trajectory of a mobile-base toward a desired goal in the generated environment representation. Finally we investigate and clarify the concepts and mathematical tools of the Lie theory, which we use extensively to provide rigorous mathematical foundation to our developments, focusing on the subset of the theory that is useful to state estimate in robotics. As the first identified space for improvements, the problem of place recognition for closing loops in SLAM is addressed. Loop closure concerns the ability of a robot to recognize a previously visited location and infer geometrical information between its current and past locations. Using only a 2D laser range finder sensor, the task is challenging as the perception of the environment provided by the sensor is sparse and limited. We tackle the problem using a technique borrowed from the field of Natural Language Processing (NLP) which has been successfully applied to image-based place recognition, namely the Bag-of-Words. We further improve the method with two proposals inspired from NLP. Firstly the comparison of places is strengthen by taking into account the natural relative order of features in each individual sensor readings. Secondly, topological correspondences between places in a corpus of visited places are established in order to promote together instances that are ‘close’ to one another. We evaluate both our proposals separately and jointly on several data sets, with and without noise, and show an improvement over the state of the art.
DescripciónTesis llevada a cabo para conseguir el grado de Doctor por la Universidad Politécnica de Cataluña.--2020-09-29
Versión del editorhttp://hdl.handle.net/2117/331092
URIhttp://hdl.handle.net/10261/235670
Aparece en las colecciones: (IRII) Tesis




Ficheros en este ítem:
Fichero Descripción Tamaño Formato
TJD1de1.pdf6,49 MBAdobe PDFVista previa
Visualizar/Abrir
Mostrar el registro completo

CORE Recommender

Page view(s)

67
checked on 26-abr-2024

Download(s)

117
checked on 26-abr-2024

Google ScholarTM

Check


Este item está licenciado bajo una Licencia Creative Commons Creative Commons