SLAM++-A highly efficient and temporally scalable incremental SLAM framework

2017 ◽  
Vol 36 (2) ◽  
pp. 210-230 ◽  
Author(s):  
Viorela Ila ◽  
Lukas Polok ◽  
Marek Solony ◽  
Pavel Svoboda

The most common way to deal with the uncertainty present in noisy sensorial perception and action is to model the problem with a probabilistic framework. Maximum likelihood estimation is a well-known estimation method used in many robotic and computer vision applications. Under Gaussian assumption, the maximum likelihood estimation converts to a nonlinear least squares problem. Efficient solutions to nonlinear least squares exist and they are based on iteratively solving sparse linear systems until convergence. In general, the existing solutions provide only an estimation of the mean state vector, the resulting covariance being computationally too expensive to recover. Nevertheless, in many simultaneous localization and mapping (SLAM) applications, knowing only the mean vector is not enough. Data association, obtaining reduced state representations, active decisions and next best view are only a few of the applications that require fast state covariance recovery. Furthermore, computer vision and robotic applications are in general performed online. In this case, the state is updated and recomputed every step and its size is continuously growing, therefore, the estimation process may become highly computationally demanding. This paper introduces a general framework for incremental maximum likelihood estimation called SLAM++, which fully benefits from the incremental nature of the online applications, and provides efficient estimation of both the mean and the covariance of the estimate. Based on that, we propose a strategy for maintaining a sparse and scalable state representation for large scale mapping, which uses information theory measures to integrate only informative and non-redundant contributions to the state representation. SLAM++ differs from existing implementations by performing all the matrix operations by blocks. This led to extremely fast matrix manipulation and arithmetic operations used in nonlinear least squares. Even though this paper tests SLAM++ efficiency on SLAM problems, its applicability remains general.

2022 ◽  
Vol 7 (2) ◽  
pp. 2820-2839
Author(s):  
Saurabh L. Raikar ◽  
◽  
Dr. Rajesh S. Prabhu Gaonkar ◽  

<abstract> <p>Jaya algorithm is a highly effective recent metaheuristic technique. This article presents a simple, precise, and faster method to estimate stress strength reliability for a two-parameter, Weibull distribution with common scale parameters but different shape parameters. The three most widely used estimation methods, namely the maximum likelihood estimation, least squares, and weighted least squares have been used, and their comparative analysis in estimating reliability has been presented. The simulation studies are carried out with different parameters and sample sizes to validate the proposed methodology. The technique is also applied to real-life data to demonstrate its implementation. The results show that the proposed methodology's reliability estimates are close to the actual values and proceeds closer as the sample size increases for all estimation methods. Jaya algorithm with maximum likelihood estimation outperforms the other methods regarding the bias and mean squared error.</p> </abstract>


Sign in / Sign up

Export Citation Format

Share Document