Simultaneous Localization and Mapping in Repeating Environments

Master's thesis Mechatronics MAS500 - University of Agder 2018Konfidensiell til / confidential until 01.07.202

Improved Particle Filter Based Localization and Mapping Techniques

One of the most fundamental problems in mobile robotics is localization. The solution to most problems requires that the robot first determine its location in the environment. Even if the absolute position is not necessary, the robot must know where it is in relation to other objects. Virtually all activities require this preliminary knowledge. Another part of the localization problem is mapping, the robot’s position depends on its representation of the environment. An object’s position cannot be known in isolation, but must be determined in relation to the other objects. A map gives the robot’s understanding of the world around it, allowing localization to provide a position within that representation. The quality of localization thus depends directly on the quality of mapping. When a robot is moving in an unknown environment these problems must be solved simultaneously in a problem called SLAM (Simultaneous Localization and Mapping). Some of the best current techniques for localization and SLAM are based on particle filters which approximate the belief state. Monte Carlo Localization (MCL) is a solution to basic localization, while FastSLAM is used to solve the SLAM problem. Although these techniques are powerful, certain assumptions reduce their effectiveness. In particular, both techniques assume an underlying static environment, as well as certain basic sensor models. Also, MCL applies to the case where the map is entirely known while FastSLAM solves an entirely unknown map. In the case of partial knowledge, MCL cannot succeed while FastSLAM must discard the additional information. My research provides improvements to particle based localization and mapping which overcome some of the problems with these techniques, without reducing the original capabilities of the algorithms. I also extend their application to additional situations and make them more robust to several types of error. The improved solutions allow more accurate localization to be performed, so that robots can be used in additional situations

Localização e mapeamento eficiente para robótica : algoritmos e ferramentas

Doutoramento conjunto em InformáticaUm dos problemas fundamentais em robótica é a capacidade de estimar a pose de um robô móvel relativamente ao seu ambiente. Este problema é conhecido como localização robótica e a sua exatidão e eficiência têm um impacto direto em todos os sistemas que dependem da localização. Nesta tese, abordamos o problema da localização propondo um algoritmo baseado em scan matching com otimização robusta de mínimos quadrados não lineares em manifold com a utilização de um campo de verosimilhança contínuo como modelo de perceção. Esta solução oferece uma melhoria percetível na eficiência computacional sem perda de exatidão. Associado à localização está o problema de criar uma representação geométrica (ou mapa) do meio ambiente recorrendo às medidas disponíveis, um problema conhecido como mapeamento. No mapeamento a representação geométrica mais popular é a grelha volumétrica que discretiza o espaço em volumes cúbicos de igual tamanho. A implementação direta de uma grelha volumétrica oferece acesso direto e rápido aos dados mas requer uma quantidade substancial de memória. Portanto, propõe-se uma estrutura de dados híbrida, com divisão esparsa do espaço combinada com uma subdivisão densa do espaço que oferece tempos de acesso eficientes com alocações de memória reduzidas. Além disso, também oferece um mecanismo integrado de compressão de dados para reduzir ainda mais o uso de memória e uma estrutura de partilha de dados implícita que duplica dados, de forma eficiente, quando necessário recorrendo a uma estratégia copy-on-write. A implementação da solução descrita é disponibilizada na forma de uma biblioteca de software que oferece um framework para a criação de modelos baseados em grelhas volumétricas, e.g. grelhas de ocupação. Como existe uma separação entre o modelo e a gestão de espaço, todas as funcionalidades da abordagem esparsa-densa estão disponíveis para qualquer modelo implementado com o framework. O processo de mapeamento é um problema complexo considerando que localização e mapeamento são resolvidos simultaneamente. Este problema, conhecido como localização e mapeamento simultâneo (SLAM), tem tendência a de consumir recursos consideráveis à medida que a exigência na qualidade do mapeamento aumenta. De modo a contribuir para o aumento da eficiência, esta tese apresenta duas solução de SLAM. Na primeira abordagem, o algoritmo de localização é adaptado ao mapeamento incremental que, em combinação com o framework esparso-denso, oferece uma solução de SLAM online computacionalmente eficiente. O resultados obtidos são comparados com outras soluções disponíveis na literatura recorrendo a um benchmark de SLAM. Os resultados obtidos demonstram que a nossa solução oferece uma boa eficiência sem comprometer a exatidão. A segunda abordagem combina o nosso SLAM online com um filtro de partículas Rao-Blackwellized para propor uma solução de full SLAM com um grau elevado de eficiência computacional. A solução inclui propostas de distribuição melhorada com refinamento de pose através de scan matching, re-amostragem adaptativa com pesos de amostragem suavizados, partilha eficiente de dados entre partículas da mesma geração e suporte para multi-threading.One of the most basic perception problems in robotics is the ability to estimate the pose of a mobile robot relative to the environment. This problem is known as mobile robot localization and its accuracy and efficiency has a direct impact in all systems than depend on localization. In this thesis, we address the localization problem by proposing an algorithm based on scan matching with robust non-linear least squares optimization on a manifold that relies on a continuous likelihood field as measurement model. This solution offers a noticeable improvement in computational efficiency without losing accuracy. Associated with localization is the problem of creating the geometric representation (or map) of the environment using the available measurements, a problem known as mapping. In mapping, the most popular geometric representation is the volumetric grid that quantizes space into cubic volumes of equal size. The regular volumetric grid implementation offers direct and fast access to data but requires a substantial amount of allocated memory. Therefore, in this thesis, we propose a hybrid data structure with sparse division of space combined with dense subdivision of space that offers efficient access times with reduced memory allocation. Additionally, it offers an online data compression mechanism to further reduce memory usage and an implicit data sharing structure that efficiently duplicates data when needed using a thread safe copy-on-write strategy. The implementation of the solution is available as a software library that provides a framework to create models based on volumetric grids, e.g. occupancy grids. The separation between the model and space management makes all features of the sparse-dense approach available to every model implemented with the framework. The process of mapping is a complex problem, considering that localization and mapping have to be solved simultaneously. This problem, known as simultaneous localization and mapping (SLAM), has the tendency to consume considerable resources as the mapping quality requirements increase. As an effort to increase the efficiency of SLAM, this thesis presents two SLAM solutions. The first proposal adapts our localization algorithm to incremental mapping that, in combination with the sparse-dense framework, provides a computationally efficient online SLAM solution. Using a SLAM benchmark, the obtained results are compared with other solutions found in the literature. The comparison shows that our solution provides good efficiency without compromising accuracy. The second approach combines our online SLAM with a Rao-Blackwellized particle filter to propose a highly computationally efficient full SLAM solution. It includes an improved proposal distribution with scan matching pose refinement, adaptive resampling with smoothed importance weight, efficient sharing of data between sibling particles and multithreading support

Navigation and Grasping with a Mobile Manipulator: from Simulation to Experimental Results

Cobot is the name for collaborative robots. This kind of robot is intended to work in close contact with the human being and to collaborate, by increasing the production rate and by reducing the human onerous tasks, in terms of repetitiveness and precision. At the state of the art, Cobots are often fixed on a support platform, static in their workstation. The aim of this thesis is, hence, to explore, test and validate navigation algorithms for a holonomic mobile robot and in a second moment, to study its behavior with a Cobot mounted on it, in a pick-move-place application. To this purpose, the first part of the thesis addresses the mobile navigation, while the second part the mobile manipulation. Concerning mobile robotics, in the first place, a theoretical background is given and the kinematic model of a holonomic robot is derived. Then, the problem of simultaneous localization and mapping (SLAM) is addressed, i.e. how the robot is able to build a map while localizing itself. Finally, a dedicated chapter will explain the algorithms responsible for exploration and navigation: planners, exploration of frontiers and Monte Carlo localization. Once the necessary theoretical background has been given, these algorithms will be tested both in simulation and in practice on a real robot. In the second part, some theoretical knowledge about manipulators is given and also the kinematic model of the Cobot is derived, together with the algorithm used for a collision free trajectory planning. To conclude, the results of the complete task are shown, first of all in simulation and then on the real robotic system

Sensor Based Localization of a Mobile Robot

Master'sMASTER OF ENGINEERIN

Simultaneous localisation and mapping with prior information

This thesis is concerned with Simultaneous Localisation and Mapping (SLAM), a technique by which a platform can estimate its trajectory with greater accuracy than odometry alone, especially when the trajectory incorporates loops. We discuss some of the shortcomings of the "classical" SLAM approach (in particular EKF-SLAM), which assumes that no information is known about the environment a priori. We argue that in general this assumption is needlessly stringent; for most environments, such as cities some prior information is known. We introduce an initial Bayesian probabilistic framework which considers the world as a hierarchy of structures, and maps (such as those produced by SLAM systems) as consisting of features derived from them. Common underlying structure between features in maps allows one to express and thus exploit geometric relations between them to improve their estimates. We apply the framework to EKF-SLAM for the case of a vehicle equipped with a range-bearing sensor operating in an urban environment, building up a metric map of point features, and using a prior map consisting of line segments representing building footprints. We develop a novel method called the Dual Representation, which allows us to use information from the prior map to not only improve the SLAM estimate, but also reduce the severity of errors associated with the EKF. Using the Dual Representation, we investigate the effect of varying the accuracy of the prior map for the case where the underlying structures and thus relations between the SLAM map and prior map are known. We then generalise to the more realistic case, where there is "clutter" - features in the environment that do not relate with the prior map. This involves forming a hypothesis for whether a pair of features in the SLAMstate and prior map were derived from the same structure, and evaluating this based on a geometric likelihood model. Initially we try an incrementalMultiple Hypothesis SLAM(MHSLAM) approach to resolve hypotheses, developing a novel method called the Common State Filter (CSF) to reduce the exponential growth in computational complexity inherent in this approach. This allows us to use information from the prior map immediately, thus reducing linearisation and EKF errors. However we find that MHSLAM is still too inefficient, even with the CSF, so we use a strategy that delays applying relations until we can infer whether they apply; we defer applying information from structure hypotheses until their probability of holding exceeds a threshold. Using this method we investigate the effect of varying degrees of "clutter" on the performance of SLAM

Active Perception for Autonomous Systems : In a Deep Space Navigation Scenario

Autonomous systems typically pursue certain goals for an extended amount of time in a self-sustainable fashion. To this end, they are equipped with a set of sensors and actuators to perceive certain aspects of the world and thereupon manipulate it in accordance with some given goals. This kind of interaction can be thought of as a closed loop in which a perceive-reason-act process takes place. The bi-directional interface between an autonomous system and the outer world is then given by a sequence of imperfect observations of the world and corresponding controls which are as well imperfectly actuated. To be able to reason in such a setting, it is customary for an autonomous system to maintain a probabilistic state estimate. The quality of the estimate -- or its uncertainty -- is, in turn, dependent on the information acquired within the perceive-reason-act loop described above. Hence, this thesis strives to investigate the question of how to actively steer such a process in order to maximize the quality of the state estimate. The question will be approached by introducing different probabilistic state estimation schemes jointly working on a manifold-based encapsuled state representation. On top of the resultant state estimate different active perception approaches are introduced, which determine optimal actions with respect to uncertainty minimization. The informational value of the particular actions is given by the expected impact of measurements on the uncertainty. The latter can be obtained by different direct and indirect measures, which will be introduced and discussed. The active perception schemes for autonomous systems will be investigated with a focus on two specific deep space navigation scenarios deduced from a potential mining mission to the main asteroid belt. In the first scenario, active perception strategies are proposed, which foster the correctional value of the sensor information acquired within a heliocentric navigation approach. Here, the expected impact of measurements is directly estimated, thus omitting counterfactual updates of the state based on hypothetical actions. Numerical evaluations of this scenario show that active perception is beneficial, i.e., the quality of the state estimate is increased. In addition, it is shown that the more uncertain a state estimate is, the more the value of active perception increases. In the second scenario, active autonomous deep space navigation in the vicinity of asteroids is investigated. A trajectory and a map are jointly estimated by a Graph SLAM algorithm based on measurements of a 3D Flash-LiDAR. The active perception strategy seeks to trade-off the exploration of the asteroid against the localization performance. To this end, trajectories are generated as well as evaluated in a novel twofold approach specifically tailored to the scenario. Finally, the position uncertainty can be extracted from the graph structure and subsequently be used to dynamically control the trade-off between localization and exploration. In a numerical evaluation, it is shown that the localization performance of the Graph SLAM approach to navigation in the vicinity of asteroids is generally high. Furthermore, the active perception strategy is able to trade-off between localization performance and the degree of exploration of the asteroid. Finally, when the latter process is dynamically controlled, based on the current localization uncertainty, a joint improvement of localization as well as exploration performance can be achieved. In addition, this thesis comprises an excursion into active sensorimotor object recognition. A sensorimotor feature is derived from biological principles of the human perceptual system. This feature is then employed in different probabilistic classification schemes. Furthermore, it enables the implementation of an active perception strategy, which can be thought of as a feature selection process in a classification scheme. It is shown that those strategies might be driven by top-down factors, i.e., based on previously learned information, or by bottom-up factors, i.e., based on saliency detected in the currently considered data. Evaluations are conducted based on real data acquired by a camera mounted on a robotic arm as well as on datasets. It is shown that the integrated representation of perception and action fosters classification performance and that the application of an active perception strategy accelerates the classification process

Optimizing robot trajectories using reinforcement learning

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.Includes bibliographical references (leaves 93-96).The mapping problem has received considerable attention in robotics recently. Mature techniques now allow practitioners to reliably and consistently generate 2-D and 3-D maps of objects, office buildings, city blocks and metropolitan areas with a comparatively small number of errors. Nevertheless, the ease of construction and quality of map are strongly dependent on the exploration strategy used to acquire sensor data. Most exploration strategies concentrate on selecting the next best measurement to take, trading off information gathering for regular relocalization. What has not been studied so far is the effect the robot controller has on the map quality. Certain kinds of robot motion (e.g, sharp turns) are hard to estimate correctly, and increase the likelihood of errors in the mapping process. We show how reinforcement learning can be used to generate better motion control. The learned policy will be shown to reduce the overall map uncertainty and squared error, while jointly reducing data-association errors.by Thomas Kollar.S.M