Lazy localization using the Frozen-Time Smoother

We present a new algorithm for solving the global localization problem called Frozen-Time Smoother (FTS). Time is 'frozen', in the sense that the belief always refers to the same time instant, instead of following a moving target, like Monte Carlo Localization does. This algorithm works in the case in which global localization is formulated as a smoothing problem, and a precise estimate of the incremental motion of the robot is usually available. These assumptions correspond to the case when global localization is used to solve the loop closing problem in SLAM. We compare FTS to two Monte Carlo methods designed with the same assumptions. The experiments suggest that a naive implementation of the FTS is more efficient than an extremely optimized equivalent Monte Carlo solution. Moreover, the FTS has an intrinsic laziness: it does not need frequent updates (scans can be integrated once every many meters) and it can process data in arbitrary order. The source code and datasets are available for download

Efficient Constellation-Based Map-Merging for Semantic SLAM

Data association in SLAM is fundamentally challenging, and handling ambiguity well is crucial to achieve robust operation in real-world environments. When ambiguous measurements arise, conservatism often mandates that the measurement is discarded or a new landmark is initialized rather than risking an incorrect association. To address the inevitable `duplicate' landmarks that arise, we present an efficient map-merging framework to detect duplicate constellations of landmarks, providing a high-confidence loop-closure mechanism well-suited for object-level SLAM. This approach uses an incrementally-computable approximation of landmark uncertainty that only depends on local information in the SLAM graph, avoiding expensive recovery of the full system covariance matrix. This enables a search based on geometric consistency (GC) (rather than full joint compatibility (JC)) that inexpensively reduces the search space to a handful of `best' hypotheses. Furthermore, we reformulate the commonly-used interpretation tree to allow for more efficient integration of clique-based pairwise compatibility, accelerating the branch-and-bound max-cardinality search. Our method is demonstrated to match the performance of full JC methods at significantly-reduced computational cost, facilitating robust object-based loop-closure over large SLAM problems.Comment: Accepted to IEEE International Conference on Robotics and Automation (ICRA) 201

LSH-RANSAC: An Incremental Scheme for Scalable Localization

This paper addresses the problem of feature- based robot localization in large-size environments. With recent progress in SLAM techniques, it has become crucial for a robot to estimate the self-position in real-time with respect to a large- size map that can be incrementally build by other mapper robots. Self-localization using large-size maps have been studied in litelature, but most of them assume that a complete map is given prior to the self-localization task. In this paper, we present a novel scheme for robot localization as well as map representation that can successfully work with large-size and incremental maps. This work combines our two previous works on incremental methods, iLSH and iRANSAC, for appearance- based and position-based localization

Computational time analysis in extended kalman filter based simultaneous localization and mapping

The simultaneous localization and mapping (SLAM) of a mobile robot is one of the applications that use estimation techniques. SLAM is a navigation technique that allows a mobile robot to navigate around autonomously while observing its surroundings in an unfamiliar environment. SLAM does not require a priori map, instead the mobile robot creates a map of the area incrementally with the help of sensors on board and uses this map to localize its location Due to its relatively easy algorithm and efficiency of estimation via the representation of the belief by a multivariate Gaussian distribution and a unimodal distribution, with a single mean annotated and corresponding covariance uncertainty, the extended Kalman filter (EKF) has become one of the most preferred estimators in mobile robot SLAM. However, due to the update process of the covariance matrix, EKF-based SLAM has high computational time. In SLAM, if more observation is being made by mobile robot, the state covariance size will be increasing. This eventually requires more memory and processing time due to excessive computation needs to be calculated over time. Therefore there is a need of enhancing the estimation performance by reducing the computational time in SLAM. Three phases involve in this research methodology which the first is theoretical formulation of the mobile robot model. This is followed by the environment and estimation method used to solve the SLAM of mobile robot. Simulation analysis was used to verify the findings. This research attempts to introduce a new approach to simplify the structure of the covariance matrix using the eigenvalues matrix diagonalization method. Through simulation result it is proved that time taken to complete the SLAM process using diagonalized covariance was reduced as compared to the normal covariance. However, there is one limitation encountered from this method in which the covariance values become too small, that indicates an optimistic estimation. For this reason, second objective is motivated to improve the optimistic problem. Addition of new element into the diagonal matrix, which is known as a pseudo element, is also investigated in this study. Via mathematical approach, these problems are discussed and explored from estimation-theoretic point of view. Through adding the pseudo noise element into diagonalized covariance, the optimistic condition of covariance matrix can be improved. This was shown through the increased size of covariance ellipses at the end of simulation process. Based on the findings it can be concluded that the addition of pseudo matrix in the updated state covariance can further improved the computational time for mobile robot estimation

Search and Rescue under the Forest Canopy using Multiple UAVs

We present a multi-robot system for GPS-denied search and rescue under the forest canopy. Forests are particularly challenging environments for collaborative exploration and mapping, in large part due to the existence of severe perceptual aliasing which hinders reliable loop closure detection for mutual localization and map fusion. Our proposed system features unmanned aerial vehicles (UAVs) that perform onboard sensing, estimation, and planning. When communication is available, each UAV transmits compressed tree-based submaps to a central ground station for collaborative simultaneous localization and mapping (CSLAM). To overcome high measurement noise and perceptual aliasing, we use the local configuration of a group of trees as a distinctive feature for robust loop closure detection. Furthermore, we propose a novel procedure based on cycle consistent multiway matching to recover from incorrect pairwise data associations. The returned global data association is guaranteed to be cycle consistent, and is shown to improve both precision and recall compared to the input pairwise associations. The proposed multi-UAV system is validated both in simulation and during real-world collaborative exploration missions at NASA Langley Research Center.Comment: IJRR revisio