Enhancing FastSLAM 2.0 performance using a DE Algorithm with Multi-mutation Strategies

FastSLAM 2.0 is considered one of the popular approaches that utilizes a Rao-Blackwellized particle filter for solving simultaneous localization and mapping (SLAM) problems. It is computationally efficient, robust and can be used to handle large and complex environments. However, the conventional FastSLAM 2.0 algorithm is known to degenerate over time in terms of accuracy because of the particle depletion problem that arises in the resampling phase. In this work, we introduce an enhanced variant of the FastSLAM 2.0 algorithm based on an enhanced differential evolution (DE) algorithm with multi-mutation strategies to improve its performance and reduce the effect of the particle depletion problem. The Enhanced DE algorithm is used to optimize the particle weights and conserve diversity among particles. A comparison has been made with other two common algorithms to evaluate the performance of the proposed algorithm in estimating the robot and landmarks positions for a SLAM problem. Results are accomplished in terms of accuracy represented by the positioning errors of robot and landmark positions as well as their root mean square errors. All results show that the proposed algorithm is more accurate than the other compared algorithms in estimating the robot and landmark positions for all the considered cases. It can reduce the effect of the particle depletion problem and improve the performance of the FastSLAM 2.0 algorithm in solving SLAM problem

Perception de la géométrie de l'environnement pour la navigation autonome

Le but de de la recherche en robotique mobile est de donner aux robots la capacité d'accomplir des missions dans un environnement qui n'est pas parfaitement connu. Mission, qui consiste en l'exécution d'un certain nombre d'actions élémentaires (déplacement, manipulation d'objets...) et qui nécessite une localisation précise, ainsi que la construction d'un bon modèle géométrique de l'environnement, a partir de l'exploitation de ses propres capteurs, des capteurs externes, de l'information provenant d'autres robots et de modèle existant, par exemple d'un système d'information géographique. L'information commune est la géométrie de l'environnement. La première partie du manuscrit couvre les différents méthodes d'extraction de l'information géométrique. La seconde partie présente la création d'un modèle géométrique en utilisant un graphe, ainsi qu'une méthode pour extraire de l'information du graphe et permettre au robot de se localiser dans l'environnement.The goal of the mobile robotic research is to give robots the capability to accomplish missions in an environment that might be unknown. To accomplish his mission, the robot need to execute a given set of elementary actions (movement, manipulation of objects...) which require an accurate localisation of the robot, as well as a the construction of good geometric model of the environment. Thus, a robot will need to take the most out of his own sensors, of external sensors, of information coming from an other robot and of existing model coming from a Geographic Information System. The common information is the geometry of the environment. The first part of the presentation will be about the different methods to extract geometric information. The second part will be about the creation of the geometric model using a graph structure, along with a method to retrieve information in the graph to allow the robot to localise itself in the environment

A comparison of data association techniques for Simultaneous Localization and Mapping

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2005.Includes bibliographical references (p. 119-124).The problem of Simultaneous Localization and Mapping (SLAM) has received a great deal of attention within the robotics literature, and the importance of the solutions to this problem has been well documented for successful operation of autonomous agents in a number of environments. Of the numerous solutions that have been developed for solving the SLAM problem many of the most successful approaches continue to either rely on, or stem from, the Extended Kalman Filter method (EKF). However, the new algorithm FastSLAM has attracted attention for many properties not found in EKF based methods. One such property is the ability to deal with unknown data association and its robustness to data association errors. The problem of data association has also received a great deal of attention in the robotics literature in recent years, and various solutions have been proposed. In an effort to both compare the performance of the EKF and FastSLAM under ambiguous data association situations, as well as compare the performance of three different data association methods a comprehensive study of various SLAM filter-data association combinations is performed. This study will consist of pairing the EKF and FastSLAM filtering approaches with the Joint Compatibility, Sequential Compatibility Nearest Neighbor, and Joint Maximum Likelihood data association methods. The comparison will be based on both contrived simulations as well as application to the publicly available Car Park data set. The simulated results will demonstrate a heavy dependence on geometry, particularly landmark separation, for the performance of both filter performance and the data association algorithms used.(cont.) The real world data set results will demonstrate that the performance of some data association algorithms, when paired with an EKF, can give identical results. At the same time a distinction in mapping performance between those pairings and the EKF paired with Joint Compatibility data association will be shown. These EKF based pairings will be contrasted to the performance obtained for the FastSLAM- Sequential Nearest Neighbor marriage. Finally, the difficulties in applying the Joint Compatibility and Joint Maximum Likelihood data association methods using FastSLAM 1.0 for this data set will be discussed.by Aron J. Cooper.S.M

Mapping and Localization in Urban Environments Using Cameras

In this work we present a system to fully automatically create a highly accurate visual feature map from image data aquired from within a moving vehicle. Moreover, a system for high precision self localization is presented. Furthermore, we present a method to automatically learn a visual descriptor. The map relative self localization is centimeter accurate and allows autonomous driving

Real-time simulator of collaborative and autonomous vehicles

Durant ces dernières décennies, l’apparition des systèmes d’aide à la conduite a essentiellement été favorisée par le développement des différentes technologies ainsi que par celui des outils mathématiques associés. Cela a profondément affecté les systèmes de transport et a donné naissance au domaine des systèmes de transport intelligents (STI). Nous assistons de nos jours au développement du marché des véhicules intelligents dotés de systèmes d’aide à la conduite et de moyens de communication inter-véhiculaire. Les véhicules et les infrastructures intelligents changeront le mode de conduite sur les routes. Ils pourront résoudre une grande partie des problèmes engendrés par le trafic routier comme les accidents, les embouteillages, la pollution, etc. Cependant, le bon fonctionnement et la fiabilité des nouvelles générations des systèmes de transport nécessitent une parfaite maitrise des différents processus de leur conception, en particulier en ce qui concerne les systèmes embarqués. Il est clair que l’identification et la correction des défauts des systèmes embarqués sont deux tâches primordiales à la fois pour la sauvegarde de la vie humaine, à la fois pour la préservation de l’intégrité des véhicules et des infrastructures urbaines. Pour ce faire, la simulation numérique en temps réel est la démarche la plus adéquate pour tester et valider les systèmes de conduite et les véhicules intelligents. Elle présente de nombreux avantages qui la rendent incontournable pour la conception des systèmes embarqués. Par conséquent, dans ce projet, nous présentons une nouvelle plateforme de simulation temps-réel des véhicules intelligents et autonomes en conduite collaborative. Le projet se base sur deux principaux composants. Le premier étant les produits d’OPAL-RT Technologies notamment le logiciel RT-LAB « en : Real Time LABoratory », l’application Orchestra et les machines de simulation dédiées à la simulation en temps réel et aux calculs parallèles, le second composant est Pro-SiVIC pour la simulation de la dynamique des véhicules, du comportement des capteurs embarqués et de l’infrastructure. Cette nouvelle plateforme (Pro-SiVIC/RT-LAB) permettra notamment de tester les systèmes embarqués (capteurs, actionneurs, algorithmes), ainsi que les moyens de communication inter-véhiculaire. Elle permettra aussi d’identifier et de corriger les problèmes et les erreurs logicielles, et enfin de valider les systèmes embarqués avant même le prototypage

Autonomous Navigation of Distributed Spacecraft using Graph-based SLAM for Proximity Operations in Small Celestial Bodies

Establishment of a sustainable human presence beyond the cislunar space is a major milestone for mankind. Small celestial bodies (SCBs) like asteroids are known to contain valuable natural resources necessary for the development of space assets essential to the accomplishment of this goal. Consequently, future robotic spacecraft missions to SCBs are envisioned with the objective of commercial in-situ resource utilization (ISRU). In mission design, there is also an increasing interest in the utilization of the distributed spacecraft, to benefit from specialization and redundancy. The ability of distributed spacecraft to navigate autonomously in the proximity of a SCB is indispensable for the successful realization of ISRU mission objectives. Quasi-autonomous methods currently used for proximity navigation require extensive ground support for mapping and model development, which can be an impediment for large scale multi-spacecraft ISRU missions in the future. It is prudent to leverage the advances in terrestrial robotic navigation to investigate the development of novel methods for autonomous navigation of spacecraft. The primary objective of the work presented in this thesis is to evaluate the feasibility and investigate the development of methods based on graph-based simultaneous localization and mapping (SLAM), a popular algorithm used in terrestrial autonomous navigation, for the autonomous navigation of distributed spacecraft in the proximity of SCBs. To this end, recent research in graph-based SLAM is extensively studied to identify strategies used to enable multi-agent navigation. The spacecraft navigation requirement is formulated as a graph-based SLAM problem using metric GraphSLAM or topometric graph-based SLAM. Techniques developed based on the identified strategies namely, map merging, inter-spacecraft measurements and relative localization are then applied to this formulation to enable distributed spacecraft navigation. In each case, navigation is formulated in terms of its application to a proximity operation scenario that best suits the multi-agent navigation technique. Several challenges related to the application of graph-based SLAM for spacecraft navigation, such as computational cost and illumination variation are also identified and addressed in the development of these methods. Experiments are performed using simulated models of asteroids and spacecraft dynamics, comparing the estimated states of the spacecraft and landmarks to the assumed true states. The results from the experiments indicate a consistent and robust state determination process, suggesting the suitability of the application of multi-agent navigation techniques to graph-based SLAM for enabling the autonomous navigation of distributed spacecraft near SCBs

Active Information Acquisition With Mobile Robots

The recent proliferation of sensors and robots has potential to transform fields as diverse as environmental monitoring, security and surveillance, localization and mapping, and structure inspection. One of the great technical challenges in these scenarios is to control the sensors and robots in order to extract accurate information about various physical phenomena autonomously. The goal of this dissertation is to provide a unified approach for active information acquisition with a team of sensing robots. We formulate a decision problem for maximizing relevant information measures, constrained by the motion capabilities and sensing modalities of the robots, and focus on the design of a scalable control strategy for the robot team. The first part of the dissertation studies the active information acquisition problem in the special case of linear Gaussian sensing and mobility models. We show that the classical principle of separation between estimation and control holds in this case. It enables us to reduce the original stochastic optimal control problem to a deterministic version and to provide an optimal centralized solution. Unfortunately, the complexity of obtaining the optimal solution scales exponentially with the length of the planning horizon and the number of robots. We develop approximation algorithms to manage the complexity in both of these factors and provide theoretical performance guarantees. Applications in gas concentration mapping, joint localization and vehicle tracking in sensor networks, and active multi-robot localization and mapping are presented. Coupled with linearization and model predictive control, our algorithms can even generate adaptive control policies for nonlinear sensing and mobility models. Linear Gaussian information seeking, however, cannot be applied directly in the presence of sensing nuisances such as missed detections, false alarms, and ambiguous data association or when some sensor observations are discrete (e.g., object classes, medical alarms) or, even worse, when the sensing and target models are entirely unknown. The second part of the dissertation considers these complications in the context of two applications: active localization from semantic observations (e.g, recognized objects) and radio signal source seeking. The complexity of the target inference problem forces us to resort to greedy planning of the sensor trajectories. Non-greedy closed-loop information acquisition with general discrete models is achieved in the final part of the dissertation via dynamic programming and Monte Carlo tree search algorithms. Applications in active object recognition and pose estimation are presented. The techniques developed in this thesis offer an effective and scalable approach for controlled information acquisition with multiple sensing robots and have broad applications to environmental monitoring, search and rescue, security and surveillance, localization and mapping, precision agriculture, and structure inspection

Multi-Robot Active Information Gathering Using Random Finite Sets

Many tasks in the modern world involve collecting information, such as infrastructure inspection, security and surveillance, environmental monitoring, and search and rescue. All of these tasks involve searching an environment to detect, localize, and track objects of interest, such as damage to roadways, suspicious packages, plant species, or victims of a natural disaster. In any of these tasks the number of objects of interest is often not known at the onset of exploration. Teams of robots can automate these often dull, dirty, or dangerous tasks to decrease costs and improve speed and safety. This dissertation addresses the problem of automating data collection processes, so that a team of mobile sensor platforms is able to explore an environment to determine the number of objects of interest and their locations. In real-world scenarios, robots may fail to detect objects within the field of view, receive false positive measurements to clutter objects, and be unable to disambiguate true objects. This makes data association, i.e., matching individual measurements to targets, difficult. To account for this, we utilize filtering algorithms based on random finite sets to simultaneously estimate the number of objects and their locations within the environment without the need to explicitly consider data association. Using the resulting estimates they receive, robots choose actions that maximize the mutual information between the set of targets and the binary events of receiving no detections. This effectively hedges against uninformative actions and leads to a closed form equation to compute mutual information, allowing the robot team to plan over a long time horizon. The robots either communicate with a central agent, which performs the estimation and control computations, or act in a decentralized manner. Our extensive hardware and simulated experiments validate the unified estimation and control framework, using robots with a wide variety of mobility and sensing capabilities to showcase the broad applicability of the framework

Multitarget tracking and terrain-aided navigation using square-root consider filters

Filtering is a term used to describe methods that estimate the values of partially observed states, such as the position, velocity, and attitude of a vehicle, using current observations that are corrupted due to various sources, such as measurement noise, transmission dropouts, and spurious information. The study of filtering has been an active focus of research for decades, and the resulting filters have been the cornerstone of many of humankind\u27s greatest technological achievements. However, these achievements are enabled principally by the use of specialized techniques that seek to, in some way, combat the negative impacts that processor roundoff and truncation error have on filtering. Two of these specialized techniques are known as square-root filters and consider filters. The former alleviates the fragility induced from estimating error covariance matrices by, instead, managing a factorized representation of that matrix, known as a square-root factor. The latter chooses to account for the statistical impacts a troublesome system parameter has on the overall state estimate without directly estimating it, and the result is a substantial reduction in numerical sensitivity to errors in that parameter. While both of these techniques have found widespread use in practical application, they have never been unified in a common square-root consider framework. Furthermore, consider filters are historically rooted to standard, vector-valued estimation techniques, and they have yet to be generalized to the emerging, set-valued estimation tools for multitarget tracking. In this dissertation, formulae for the square-root consider filter are derived, and the result is extended to finite set statistics-based multitarget tracking tools. These results are used to propose a terrain-aided navigation concept wherein data regarding a vehicle\u27s environment is used to improve its state estimate, and square-root consider techniques provide the numerical stability necessary for an onboard navigation application. The newly developed square-root consider techniques are shown to be much more stable than standard formulations, and the terrain-aided navigation concept is applied to a lunar landing scenario to illustrate its applicability to navigating in challenging environments --Abstract, page iii

Autonomous robot systems and competitions: proceedings of the 12th International Conference

This is the 2012’s edition of the scientific meeting of the Portuguese Robotics Open (ROBOTICA’ 2012). It aims to disseminate scientific contributions and to promote discussion of theories, methods and experiences in areas of relevance to Autonomous Robotics and Robotic Competitions. All accepted contributions are included in this proceedings book. The conference program has also included an invited talk by Dr.ir. Raymond H. Cuijpers, from the Department of Human Technology Interaction of Eindhoven University of Technology, Netherlands.The conference is kindly sponsored by the IEEE Portugal Section / IEEE RAS ChapterSPR-Sociedade Portuguesa de Robótic