A maior parte dos mapas empregados em tarefas de navegação por robôs móveis representam apenas informações espaciais do ambiente. Outros tipos de informações, que poderiam ser obtidos dos sensores do robô e incorporados à representação, são desprezados. Hoje em dia é comum um robô móvel conter sensores de distância e um sistema de visão, o que permitiria a princípio usá-lo na realização de tarefas complexas e gerais de maneira autônoma, dada uma representação adequada e um meio de extrair diretamente dos sensores o conhecimento necessário. Uma representação possível nesse contexto consiste no acréscimo de informação semântica aos mapas métricos, como por exemplo a segmentação do ambiente seguida da rotulação de cada uma de suas partes. O presente trabalho propõe uma maneira de estruturar a informação espacial criando um mapa semântico do ambiente que representa, além de obstáculos, um vínculo entre estes e as imagens segmentadas correspondentes obtidas por um sistema de visão omnidirecional. A representação é implementada por uma descrição relacional do domínio, que quando instanciada gera um campo aleatório condicionado, onde são realizadas as inferências. Modelos que combinam probabilidade e lógica de primeira ordem são mais expressivos e adequados para estruturar informações espaciais em semânticas. / Most maps used in navigational tasks by mobile robots represent only environmental spatial information. Other kinds of information, that might be obtained from the sensors of the robot and incorporated in the representation, are negleted. Nowadays it is common for mobile robots to have distance sensors and a vision system, which could in principle be used to accomplish complex and general tasks in an autonomously manner, given an adequate representation and a way to extract directly from the sensors the necessary knowledge. A possible representation in this context consists of the addition of semantic information to metric maps, as for example the environment segmentation followed by an attribution of labels to them. This work proposes a way to structure the spatial information in order to create a semantic map representing, beyond obstacles, an anchoring between them and the correspondent segmented images obtained by an omnidirectional vision system. The representation is implemented by a domains relational description that, when instantiated, produces a conditional random field, which supports the inferences. Models that combine probability and firstorder logic are more expressive and adequate to structure spatial in semantic information.

A navegação autônoma é uma tarefa fundamental na robótica móvel. Para que esta tarefa seja realizada corretamente é necessário um sistema inteligente de controle e navegação associado ao sistema sensorial. Este projeto apresenta o desenvolvimento de um sistema de controle para a navegação de veículos e robôs móveis autônomos. A abordagem utilizada neste trabalho utiliza Redes Neurais Artificiais para o aprendizado de Autômatos Finitos de forma que os robôs possam lidar com os dados provenientes de seus sensores mesmo estando sujeitos a imprecisões e erros e ao mesmo tempo permite que sejam consideradas as diferentes situações e estados em que estes robôs se encontram (contexto). Dessa forma, é possível decidir como agir para realizar o controle da sua movimentação, e assim executar tarefas de controle e navegação das mais simples até as mais complexas e de alto nível. Portanto, esta dissertação visa utilizar Redes Neurais Artificiais para reconhecer o estado atual (contexto) do robô em relação ao ambiente em que está inserido. Uma vez que seja identificado seu estado, o que pode inclusive incluir a identificação de sua posição em relação aos elementos presentes no ambiente, o robô será capaz de decidir qual a ação/comportamento que deverá ser executado. O sistema de controle e navegação irá implementar um Autômato Finito que a partir de um estado atual define uma ação corrente, sendo capaz de identificar a mudança de estados, e assim alternar entre diferentes comportamentos previamente definidos. De modo a validar esta proposta, diversos experimentos foram realizados através do uso de um simulador robótico (Player-Stage), e através de testes realizados com robôs reais (Pioneer P3-AT, SRV-1 e veículos automatizados) / Autonomous navigation is a fundamental task in mobile robotics. In order to accurately perform this task it is necessary an intelligent navigation and control system associated to the sensorial system. This project presents the development of a control system for autonomous mobile robots and vehicles navigation. The adopted approach uses Artificial Neural Networks for Finite State Machine learning, allowing the robots to deal with sensorial data even when this data is not precise and correct. Simultaneously, it allows the robots to consider the different situations and states they are inserted in (context detection). This way, it is possible to decide how to proceed with motion control and then execute navigation and control tasks from the most simple ones until the most complex and high level tasks. So, this work uses Artificial Neural Networks to recognize the robots current state (context) at the environment where it is inserted. Once the state is detected, including identification of robots position according to environment elements, the robot will be able to determine the action/- behavior to be executed. The navigation and control system implements a Finite State Machine deciding the current action from current state, being able to identify state changes, alternating between different previously defined behaviors. In order to validade this approach, many experiments were performed with the use of a robotic simulator (Player-Stage), and carrying out tests with real robots (Pioneer P3-AT, SRV-1 and autonomous vehicles)

This dissertation is concerned with three-dimensional (3D) sensing and 3D scan representation. Three-dimensional records are important tools in several disciplines; such as medical imaging, archaeology, and mobile robotics. This dissertation proposes the normal-distributions transform, NDT, as a general 3D surface representation with applications in scan registration, localisation, loop detection, and surface-structure analysis. After applying NDT, the surface is represented by a smooth function with analytic derivatives. This representation has several attractive properties. The smooth function representation makes it possible to use standard numerical optimisation methods, such as Newton’s method, for 3D registration. This dissertation extends the original two-dimensional NDT registration algorithm of Biber and Straßer to 3D and introduces a number of improvements. The 3D-NDT scan-registration algorithm is compared to current de facto standard registration algorithms. 3D-NDT scan registration with the proposed extensions is shown to be more robust, more accurate, and faster than the popular ICP algorithm. An additional benefit is that 3D-NDT registration provides a confidence measure of the result with little additional effort. Furthermore, a kernel-based extension to 3D-NDT for registering coloured data is proposed. Approaches based on local visual features typically use only a small fraction of the available 3D points for registration. In contrast, Colour-NDT uses all of the available 3D data. The dissertation proposes to use a combination of local visual features and Colour-NDT for robust registration of coloured 3D scans. Also building on NDT, a novel approach using 3D laser scans to perform appearance-based loop detection for mobile robots is proposed. Loop detection is an importantproblem in the SLAM (simultaneous localisation and mapping) domain. The proposed approach uses only the appearance of 3D point clouds to detect loops and requires nopose information. It exploits the NDT surface representation to create histograms based on local surface orientation and smoothness. The surface-shape histograms compress the input data by two to three orders of magnitude. Because of the high compression rate, the histograms can be matched efficiently to compare the appearance of two scans. Rotation invariance is achieved by aligning scans with respect to dominant surface orientations. In order to automatically determine the threshold that separates scans at loop closures from nonoverlapping ones, the proposed approach uses expectation maximisation to fit a Gamma mixture model to the output similarity measures. In order to enable more high-level tasks, it is desirable to extract semantic information from 3D models. One important task where such 3D surface analysis is useful is boulder detection for mining vehicles. This dissertation presents a method, also inspired by NDT, that provides clues as to where the pile is, where the bucket should be placed for loading, and where there are obstacles. The points of 3D point clouds are classified based on the surrounding surface roughness and orientation. Other potential applications include extraction of drivable paths over uneven surfaces.

Este projeto apresenta uma metodologia aplicada à análise da viabilidade de se otimizar código fonte C para o processador embarcado Nios II. Esta metodologia utiliza ferramentas de análise de código que traçam o perfil da aplicação, identificando suas partes críticas em relação ao tempo de execução, as quais são o gprof e o performance counter. Para otimizar o código para o processador Nios II, são utilizadas tanto instruções customizadas quanto uma ferramenta automática de aceleração de código, o compilador C2H. Como casos de estudo, foram escolhidos três algoritmos devido à sua importância no campo da robótica móvel, sendo eles o gaxpy, o EKF e o SIFT. A partir da aplicação da metodologia para se otimizar cada um dos casos, foi comparada a eficiência tanto das ferramentas de análise de código, quanto das ferramentas de otimização, bem como a validade da metodologia proposta / This project presents a methodology applied to analyze the viability of C source code optimization for the Nios II embedded processor. This methodology utilizes the gprof and performance counter source code analysis tools to profile the source code of an application, and identify its critical time consuming parts. The optimization of C source code for the Nios II processor was performed using custom instructions and an automatic source code acceleration tool, the C2H compiler. Three algorithms were chosen as study cases, based on their importance to mobile robotics. Those were the gaxpy, EKF and SIFT algorithms. After applying the presented methodology to optimize each study case, efficiency comparisons were made between the source code analysis tools, as well between the optimization tools, in order to validate the presented methodology

A segurança no tráfego de carros é um assunto em foco nos dias de hoje e, dentro dele, podem-se citar os sistemas de auxílio ao motorista que vêm sendo desenvolvidos com a finalidade de reduzir o grande número de fatalidades em acidentes de trânsito. Tais sistemas de auxílio buscam mitigar falhas humanas como falta de atenção e imprudência. Visto isso, o projeto SENA, desenvolvido pelo Laboratório de Robótica Móvel da Escola de Engenharia de São Carlos, busca contribuir com a evolução dessa assistência ao motorista. O presente trabalho realiza um estudo sobre uma técnica de inteligência artificial chamada de Redes Bayesianas. Essa técnica merece atenção em virtude de sua capacidade de tratar dados incertos em forma de probabilidades. A rede desenvolvida por esse trabalho utiliza, como dados de entrada, os classificadores em desenvolvimento no projeto SENA e tem como resposta um comportamento que o veículo deve executar, por um ser humano ou por um planejador de trajetórias. Em função da alta dimensionalidade do problema abordado, foram realizados dois experimentos em ambiente simulado de duas situações distintas. A primeira, um teste de frenagem próximo a um ponto de intersecção e a segunda, um cenário de entroncamento. Os testes feitos com a rede indicam que classificadores pouco discriminantes deixam o sistema mais propenso a erros e que erros na localização do ego-veículo afetam mais o sistema se comparado a erros na localização dos outros veículos. Os experimentos realizados mostram a necessidade de um sistema de tempo real e um hardware mais adequado para tratar as informações mais rapidamente / The safety of cars in traffic scenarios is being addressed on the past few years. One of its topics is the Advanced Driver-Assistance Systems which have been developed to reduce the fatality numbers of traffic accidents. These systems try to decrease human failures, such as imprudence and lack of attention while driving. For these reasons, the SENA project, in progress on the Mobile Robotics Laboratory at the Sao Carlos School of Engineering (EESC), aims to contribute for the evolution of these assistance systems. This work studies an artificial intelligence technique called Bayesian Networks. It deserves our attention due to its capability of handling uncertainties with probability distributions. The network developed in this Masters Thesis has, as input, the result of the classifiers used on SENA project and has, as output, a behavior which has to be performed by the vehicle with a driver or autonomously by the means of a path planner. Due to the high dimensionality of this issue, two different tests have been carried out. The first one was a braking experiment near a intersection point and the other one was a T-junction scenario. The tests made indicate that weak classifiers leaves the system more instable and error-prone and localization errors of the ego-vehicle have a stronger effect than just localization errors of other traffic participants. The experiments have shown that there is a necessity for a real-time system and a hardware more suitable to deal quickly with the information

Cette thèse propose des modèles cartographiques à grande échelle d'environnements urbains et ruraux à l'aide de données en 3D acquises par plusieurs robots. La mémoire contribue de deux manières principales au domaine de recherche de la cartographie. La première contribution est la création d'une nouvelle structure, CoMapping, qui permet de générer des cartes 3D de façon collaborative. Cette structure s’applique aux environnements extérieurs en ayant une approche décentralisée. La fonctionnalité de CoMapping comprend les éléments suivants : Tout d’abord, chaque robot réalise la construction d'une carte de son environnement sous forme de nuage de points.Pour cela, le système de cartographie a été mis en place sur des ordinateurs dédiés à chaque voiture, en traitant les mesures de distance à partir d'un LiDAR 3D se déplaçant en six degrés de liberté (6-DOF). Ensuite, les robots partagent leurs cartes locales et fusionnent individuellement les nuages de points afin d'améliorer leur estimation de leur cartographie locale. La deuxième contribution clé est le groupe de métriques qui permettent d'analyser les processus de fusion et de partage de cartes entre les robots. Nous présentons des résultats expérimentaux en vue de valider la structure CoMapping et ses métriques. Tous les tests ont été réalisés dans des environnements extérieurs urbains du campus de l’École Centrale de Nantes ainsi que dans des milieux ruraux. / This thesis proposes large-scale mapping model of urban and rural environments using 3D data acquired by several robots. The work contributes in two main ways to the research field of mapping. The first contribution is the creation of a new framework, CoMapping, which allows to generate 3D maps in a cooperative way. This framework applies to outdoor environments with a decentralized approach. The CoMapping's functionality includes the following elements: First of all, each robot builds a map of its environment in point cloud format.To do this, the mapping system was set up on computers dedicated to each vehicle, processing distance measurements from a 3D LiDAR moving in six degrees of freedom (6-DOF). Then, the robots share their local maps and merge the point clouds individually to improve their local map estimation. The second key contribution is the group of metrics that allow to analyze the merging and card sharing processes between robots. We present experimental results to validate the CoMapping framework with their respective metrics. All tests were carried out in urban outdoor environments on the surrounding campus of the École Centrale de Nantes as well as in rural areas.

Letecká fotogrammetrie v oblasti bezpilotních systémů představuje rychle rozvíjející se obor nalézající uplatnění napříč nejen průmyslovými odvětvími. Široce rozšířená metoda nepřímého georeferencování založená na vlícovacích bodech sice dosahuje vysoké přesnosti a spolehlivosti, v některých speciálních aplikacích nicméně není použitelná. Tato disertační práce se zabývá vývojem senzorického systému pro přímé georeferencování aplikovatelného na malých bezpilotních prostředcích a dále také návrhem vhodných kalibračních metod a testováním přesnosti. Významná část práce je věnována novým oblastem, kde může navržený systém pomoci eliminovat bezpečnostní rizika spojená s daným prostředím. V tomto kontextu byl systém testován v reálných podmínkách při mapování sněhu v horských oblastech a při robotickém mapování radiace.

This thesis is about the intelligent compression of large 3D point cloud datasets. The non-parametric method that we describe simultaneously generates a continuous representation of the workspace surfaces from discrete laser samples and decimates the dataset, retaining only locally salient samples. Our framework attains decimation factors in excess of two orders of magnitude without significant degradation in fidelity. The work presented here has a specific focus on gathering and processing laser measurements taken from a moving platform in outdoor workspaces. We introduce a somewhat unusual parameterisation of the problem and look to Gaussian Processes as the fundamental machinery in our processing pipeline. Our system compresses laser data in a fashion that is naturally sympathetic to the underlying structure and complexity of the workspace. In geometrically complex areas, compression is lower than that in geometrically bland areas. We focus on this property in detail and it leads us well beyond a simple application of non-parametric techniques. Indeed, towards the end of the thesis we develop a non-stationary GP framework whereby our regression model adapts to the local workspace complexity. Throughout we construct our algorithms so that they may be efficiently implemented. In addition, we present a detailed analysis of the proposed system and investigate model parameters, metric errors and data compression rates. Finally, we note that this work is predicated on a substantial amount of robotics engineering which has allowed us to produce a high quality, peer reviewed, dataset - the first of its kind.

Dans cette thèse, nous présentons tout d'abord une contribution visant à pallier ce problème de robustesse pour la reconnaissance d'instances, puis une extension directe de cette contribution à la reconnaissance et la localisation de classes d'objets. Dans un premier temps, nous avons développé une méthode inspiré de l'appariement de graphe (i.e. graph matching) afin de traiter le problème de la reconnaissance rapide d'instances d'objets spécifiques dans des conditions bruitées. Cette méthode permet de rajouter facilement un nombre quelconque d’autres types de caractéristiques locales (e.g. contours, textures…) moins affectées par le bruit tout en contournant le problème de la normalisation et sans pénaliser la vitesse de détection. Nos expériences sur plusieurs bases de test ont montré la pertinence de notre approche. Notre approche est globalement légèrement moins robuste à l'occultation que les approches existantes, mais elle produit des performances supérieures aux approches standard en conditions bruitées. Dans un second temps, nous avons développé une approche pour la détection de classes d'objets dans le même esprit que celui du sac de mots visuels. Pour cela, nous utilisons nos cascades de micro-classifieurs pour reconnaître des mots visuels plus distinctifs que les mots basés simplement sur des points d'intérêts. L'apprentissage se divise en deux parties: dans un premier temps, nous générons des cascades de micro-classifieurs servant à reconnaître des parties locales des images modèles ; puis dans un second temps, nous utilisons un classifieur afin de modéliser la frontière de décision entre les images de classe et celles de non-classe. Nous montrons que l'association de mots classiques (à partir de points d'intérêts) et de nos mots plus distincts produit une amélioration significative des performances pour un temps de calcul assez faible. / In this thesis, we first present a contribution to overcome this problem of robustness for the recognition of object instances, then we straightly extend this contribution to the detection and localization of classes of objects. In a first step, we have developed a method inspired by graph matching to address the problem of fast recognition of instances of specific objects in noisy conditions. This method allows to easily combine any types of local features (eg contours, textures ...) less affected by noise than keypoints, while bypassing the normalization problem and without penalizing too much the detection speed. Unlike other methods based on a global rigid transformation, our approach is robust to complex deformations such as those due to perspective or those non-rigid inherent to the model itself (e.g. a face, a flexible magazine). Our experiments on several datasets have showed the relevance of our approach. It is overall slightly less robust to occlusion than existing approaches, but it produces better performances in noisy conditions. In a second step, we have developed an approach for detecting classes of objects in the same spirit as the bag-of-visual-words model. For this we use our cascaded micro-classifiers to recognize visual words more distinctive than the classical words simply based on visual dictionaries. Training is divided into two parts: First, we generate cascades of micro-classifiers for recognizing local parts of the model pictures and then in a second step, we use a classifier to model the decision boundary between images of class and those of non-class. We show that the association of classical visual words (from keypoints patches) and our disctinctive words results in a significant improvement. The computation time is generally quite low, given the structure of the cascades that minimizes the detection time and the form of the classifier is extremely fast to evaluate.

O adequado deslocamento autônomo de robôs móveis entre fileiras de cultura agrícola implica a apropriada configuração estrutural do veículo, bem como considerar a detecção das filas de plantas ou árvores, e também o desenvolvimento de um sistema de controle de locomoção. Esta tese apresenta o desenvolvimento de um sistema de controle em malha fechada baseado na técnica de otimização H∞, que é aplicado no deslocamento entre fileiras de plantio de um robô móvel agrícola em escala reduzida. Mais especificamente, o foco deste trabalho é o seguimento de caminhos na cultura através da aplicação de técnicas de controle robusto. Duas questões foram fundamentais na elaboração da tese: 1) \"Quais são os métodos e procedimentos necessários para implementar a navegação autônoma de um protótipo de robô móvel entre fileiras de cultura agrícola?\" e, 2) \"É possível aplicar os conceitos relativos a sistemas de controle em malha fechada para solucionar o problema da navegação autônoma do robôs móveis entre fileiras de cultura agrícola?\". Primeiramente é apresentada uma revisão bibliográfica sobre robôs móveis agrícolas que tem locomoção baseada em rodas. Posteriormente, os conceitos relacionados com o projeto de controle baseado na técnica de otimização H∞ são fundamentados. Em seguida, são descritos os detalhes relacionados com a construção da plataforma robótica proposta, o projeto do controlador de caminho, as respectivas simulações e as especificações para a realização de testes em ambiente agrícola. Finalmente os resultados alcançados são apresentados. Conclui-se que o sistema de controle proposto se mostrou efetivo na realização da navegação autônoma do robô entre as fileiras da cultura previamente configuradas para a avaliação do seu desempenho. / Appropriate autonomous navigation of mobile robots between crop rows implies, besides appropriate structural configuration, considering detection of plants or trees in rows, as well as the development of a locomotion control system. Consequently, this thesis presents the development of a closed loop control system based on H∞ optimization technique, which is applied to control the navigation of a low scale car-like mobile robot between crop rows; more specifically, main focus of this work is tracking paths in the culture, by the application of robust control techniques. Two questions were fundamental in the development of the thesis: 1) which are the methods and procedures to implement the autonomous navigation of a mobile robot prototype between crop rows? And 2) is it possible to apply the concepts of closed-loop control systems to solve the problem of autonomous navigation of mobile robots between crop rows? Firstly, we provide a literature review on agricultural mobile robots whose mobility depends on wheels. Secondly, control systems design fundamentals based on the H∞ optimization technique are addressed. Thirdly, details related to the construction of the proposed robotic platform and also the design of the proposed path controller (including its simulation and specifications for testing within an agricultural environment) are described. Finally, results of our findings are presented. It is concluded that our control system showed to be effective in the realization of autonomous navigation between crop rows in agricultural environment, which was properly configured in order to evaluate the performance of our robot.