MATLAB-based simulators for mobile robot Simultaneous Localization and Mapping

Simultaneous localization and mapping (SLAM) is a key technology for mobile robots operating under unknown environment. While FastSLAM algorithm is a popular solution to the SLAM problem, it suffers from two major drawbacks: one is particle set degeneracy due to lack of observation information in proposal distribution design of the particle filter; the other is errors accumulation caused by linearization of the nonlinear robot motion model and the nonlinear environment observation model. For the purpose of overcoming the above problems, a new iterated sigma point FastSLAM (ISP-FastSLAM) algorithm is proposed. The main contribution of the algorithm lies in the utilization of iterated sigma point Kalman filter (ISPKF), which minimizes statistical linearization error through Gaussian-Newton iteration, to design an optimal proposal distribution of the particle filter and to estimate the environment landmarks. On the basis of Rao-Blackwellized particle filter, the proposed ISP-FastSLAM algorithm is comprised by two main parts: in the first part, an iterated sigma point particle filter (ISPPF) to localize the robot is proposed, in which the proposal distribution is accurately estimated by the ISPKF; in the second part, a set of ISPKFs is used to estimate the environment landmarks. The simulation test of the proposed ISP-FastSLAM algorithm compared with FastSLAM2.0 algorithm and Unscented FastSLAM algorithm is carried out, and the performances of the three algorithms are compared. The simulation and comparing results show that the proposed ISP-FastSLAM outperforms other two algorithms both in accuracy and in robustness. The proposed algorithm provides reference for the optimization research of FastSLAM algorithm.

Simultaneous localization and mapping (SLAM) is a central and complex problem in robot research community. In SLAM, extended Kalman filter (EKF) implementation is widely used to localize the robot and build the environment map incrementally. In this paper, we propose a strong tracking filter (STF) SLAM algorithm. This algorithm applies STF to deal with the non-linear estimated problem in SLAM instead of EKF. It can make the performance of the nonlinear filter approximate to that of optimal linear Kalman Filter (KF), so it can construct high accuracy maps and locate the robot more accurately than EKF SLAM. Simulation experiments illustrate the superior performance of our approach compared to EKF SLAM algorithm.

The mobile robot which accomplishes a work in explored region does not know location information of surroundings. Traditionally, simultaneous localization and mapping(SLAM) algorithms solve the localization and mapping problem in explored regions. Among the several SLAM algorithms, the EKF (Extended Kalman Filter) based SLAM is the scheme most widely used. The EKF is the optimal sensor fusion method which has been used for a long time. The odometric error caused by an encoder can be compensated by an EKF, which fuses different types of sensor data with weights proportional to the uncertainty of each sensor. In many cases the EKF based SLAM requires artificially installed features, which causes difficulty in actual implementation. Moreover, the computational complexity involved in an EKF increases as the number of features increases. And SLAM is a weak point of long operation time. Therefore, this paper presents a symmetrical model based SLAM algorithm (called M-SLAM).

An artificial intelligent grey wolf optimizer (GWO)-assisted resampling scheme is applied to the Rao-Blackwellized particle filter (RBPF) in the simultaneous localization and mapping (SLAM). By doing this, we can make the diversity of the particles resampling and then obtain a better localization accuracy and fast convergence to realize indoor mobile robot SLAM. In addition, we propose an adaptive local data association (Range-SLAM) scheme to improve the computational efficiency for the algorithm of the nearest neighbor (NN) data association in the iteration of the RBPF prediction. Through the experiment and simulations, the proposed SLAM schemes have fast convergence, accuracy, and heuristics. Therefore, the improved RBPF and new data association schemes presented in this paper can provide a feasible method for the indoor mobile robot SLAM.

Right invariant extended Kalman filter (RIEKF) based simultaneous localization and mapping (SLAM) proposed recently has shown to be able to produce more consistent SLAM estimates as compared with traditional EKF based SLAM methods, including some improved EKF SLAM methods such as observability constrained-EKF (OC-EKF) SLAM. Latest results have demonstrated that its performance is very close to optimization based SLAM algorithms such as iSAM. In this paper, we propose to use RIEKF SLAM algorithm in active SLAM where both the predicted SLAM results for choosing control actions and the actual estimated SLAM results applying the selected control actions are computed using RIEKF algorithms. The advantages over traditional EKF based active SLAM are the more accurate and consistent predicted uncertainty estimates which result in robustness of the active SLAM algorithm. The advantages over optimization based active SLAM is the reduced computational cost. Simulation results are presented to validate the advantages of the proposed algorithm³.

Owing to low cost and relatively accurate range measurement, ultrasonic sensors are widely used in various simultaneous localisation and mapping (SLAM) applications. In spite of the abundance of ultrasonic sensor based SLAM applications, a simple and efficient algorithm for an ultrasonic sensor based positioning system with good accuracy and low computational complexity has not yet emerged. The major difficulty is the trade-off between localisation accuracy and computational complexity in most SLAM algorithms, such as extended Kalman filter (EKF) and particle filter. Typically, they improve localisation accuracy by increasing the density of the landmarks, as a result leading to high computational complexity of algorithms and limiting the utilisation of algorithms into online SLAM systems. This study addresses an improved particle filter algorithm to solve ultrasonic sensor based 2D range-only SLAM problem with relatively good accuracy and low computational complexity. This algorithm uses a simple four fixed features based system model to limit the density of the landmarks. A technique called map adjustment is proposed to increase the accuracy and efficiency of the algorithm. Using map adjustment, the proposed particle filter algorithm can improve localisation accuracy and lower computational complexity. The experiment results demonstrate that this algorithm has a better performance than conventional particle filter localisation algorithm.

This paper presents a simulator to simulating two key problems-underwater perception and autonomous manipulation o In the simulator a controller-observer strategy is proposed. A new SLAM (Simultaneous Localization and Mapping) algorithm - UKF (Unscented Kalman Filter) is used to estimate the state of UVMS (Underwater Vehicle Manipulator Systems) and the target object. 3D Simulation results show that the new SLAM algorithm can get the optimal estimation of state of UVMS and the target object, and the end-effector of manipulator can reach the desired object and the accuracy is centimeter level.

This study aims to contribute a comparison of various simultaneous localization and mapping (SLAM) algorithms that have been proposed in literature. The performance of Extended Kalman Filter (EKF) SLAM, Unscented Kalman Filter (UKF) SLAM, EKF-based FastSLAM version 2.0, and UKF-based FastSLAM (uFastSLAM) algorithms are compared in terms of accuracy of state estimations for localization of a robot and mapping of its environment. The algorithms were run using the same type of robot on Player/Stage environment. The results show that the UKF-based FastSLAM has the best performance in terms of accuracy of localization and mapping. Unlike most of the previous applications of FastSLAM in literature, no waypoints are used in this study.

Simultaneous localization and mapping (SLAM) represents a crucial algorithm in the autonomous navigation of ground vehicles. Several studies were conducted to improve the SLAM algorithm using various sensors and robot platforms. However, only a few works have focused on applications inside low-illuminated featureless tunnel environments. In this work, we present an improved SLAM algorithm using wheel encoder data from an autonomous ground vehicle (AGV) to obtain robust performance in a featureless tunnel environment. The improved SLAM system uses FAST-LIO2 LiDAR SLAM as the baseline algorithm, and the additional wheel encoder sensor data are integrated into the baseline SLAM structure using the extended Kalman filter (EKF) algorithm. The EKF algorithm is used after the LiDAR odometry estimation and before the mapping process of FAST-LIO2. The prediction step uses the wheel encoder and inertial measurement unit (IMU) data, while the correction step uses the FAST-LIO2 LiDAR state estimation. We used an AGV to conduct experiments in flat and inclined terrain sections in a tunnel environment. The results showed that the mapping and the localization process in the SLAM algorithm was greatly improved in a featureless tunnel environment considering both inclined and flat terrains.

This paper describes an approach that combines the navigation data given by a Doppler Velocity Logs (DVL), the MTi Motion Reference Unit (MRU) and a Mechanically Scanned Imaging Sonar (MSIS) as a principal sensor to efficiently solve underwater Simultaneous Localization and Mapping (SLAM) problem in structured environments such as marine platforms, harbors, or dams, etc. The MSIS has been chosen of its capacity to produce a rich representation of the environment. In recent years, to solve the SLAM Autonomous Underwater Vehicle (AUV) problem, very few solutions have been proposed. Our contribution has introduced a method based on the Nonlinear H-infinity filter \((NH\infty )\) to solve the SLAM-AUV problem. In this work, the \(NH\infty \)-SLAM algorithm is implemented to construct a map in partially structured environments and localize the AUV within this map. The data-set used in this paper are taken from the experiments carried out in a marina located in the Costa Brava (Spain) with the Ictineu AUV which is necessary to test different SLAM algorithms. The validation of the proposed algorithm through simulation in offline is presented and compared to the EKF-SLAM algorithm. The \(NH\infty \)-SLAM algorithm provides an accurate estimate than EKF-SLAM and good results were obtained.

Visual simultaneous localization and mapping (SLAM) is a critical technology for autonomous navigation in dynamic environments. However, traditional SLAM algorithms often struggle to maintain accuracy in highly dynamic environments, where elements undergo significant, rapid, and unpredictable changes, leading to asymmetric information acquisition. Aiming to improve the accuracy of the SLAM algorithm in a dynamic environment, a dynamic SLAM algorithm based on deep learning is proposed. Firstly, YOLOv10n is used to improve the front end of the system, and semantic information is added to each frame of the image. Then, ORB-SLAM2 is used to extract feature points in each region of each frame and retrieve semantic information from YOLOv10n. Finally, through the map construction thread, the dynamic object feature points extracted by YOLOv10n are eliminated, and the construction of a static map is realized. The experimental results show that the accuracy of the proposed algorithm is improved by more than 96% compared with the state-of-the-art ORB-SLAM2 in a highly dynamic environment. Compared with other dynamic SLAM algorithms, the proposed algorithm has improved both accuracy and runtime.

To navigate successfully, a mobile robot must be able to estimate the spatial relationships of the objects of interest accurately. A SLAM (Simultaneous Localization and Mapping) system employs its sensor data to build incrementally a map of an unknown environment and to localize itself in the map simultaneously. Thanks to recent advances in computer vision and cheaper cameras, vision sensors have become popular to solve SLAM problems. The proposed bearing-only SLAM system requires only a single camera which is simple and affordable for the navigation of domestic robots such as autonomous lawn-mowers and vacuum cleaners. Existing approaches to bearing-only SLAM require the readings from an odometer to estimate the robot locations prior to landmark initialization. This chapter presents a new 2-dimensional bearing-only SLAM system that relies only on the bearing measurements from a single camera. Our proposed system does not require any other sensors like range sensors or wheel encoders. The trade-off is that it requires the robot to be able to move in a straight line for a short while to initialize the landmarks. Once the landmark positions are estimated, localization becomes easy. The induced map created by our method is only determined up to a scale factor as only bearing information is used (no range or odometry information). All the object coordinates in the map multiplied by a scale factor would not change the bearing values.

This paper presents a sensor fusion strategy applied for Simultaneous Localization and Mapping (SLAM) in dynamic environments. The designed approach consists of two features: (i) the first one is a fusion module which synthesizes line segments obtained from laser rangefinder and line features extracted from monocular camera. This policy eliminates any pseudo segments that appear from any momentary pause of dynamic objects in laser data. (ii) The second characteristic is a modified multi-sensor point estimation fusion SLAM (MPEF-SLAM) that incorporates two individual Extended Kalman Filter (EKF) based SLAM algorithms: monocular and laser SLAM. The error of the localization in fused SLAM is reduced compared with those of individual SLAM. Additionally, a new data association technique based on the homography transformation matrix is developed for monocular SLAM. This data association method relaxes the pleonastic computation. The experimental results validate the performance of the proposed sensor fusion and data association method.

This article presents the design and implementation of an autonomous navigation framework for a Quadrotor-Unmanned Aerial Vehicle (UAV) based on Simultaneous Localization and Mapping (SLAM). The proposed system leverages the Extended Kalman Filter (EKF)-SLAM algorithm, operating solely on LiDAR data and without reliance on GPS, making it highly suitable for navigation in GPS-denied or cluttered environments such as indoor settings, tunnels, and urban canyons. A dynamic model of the UAV is developed to describe its motion under 3-DoF, forming the basis for both simulation and control. The EKF-SLAM algorithm is implemented within the Robot Operating System (ROS) and tested using the Gazebo simulation environment. Experimental results confirm the algorithm’s effectiveness in real-time localization and 3D environment mapping using LiDAR data, even in the absence proprioceptive input sensor.

This thesis is about feature-based mobile robot navigation in unknown environments. The work is focusing on solving the problem of Simultaneous Localization and Mapping (SLAM) including feature extraction, estimation and complete map building solution. The robot platforms used in this work have the encoders for odometry and several laser scanners for exteroperceptive sensors. Simulations, real experiments and existing well known datasets are used in order to verify the performance of the developed algorithms. The algorithms developed in this thesis are features based meaning that instead of directly using raw sensory data geometric features are first extracted. This allows the filtering of noise from the sensors and the dynamics of the environment. More importantly, feature based approaches can reduce the amount of data needed to process, enabling the algorithms to scale in large environments. Another advantage of using features is the characteristic of better isolating informative patterns so that by exploiting specific knowledge of the environment, specialized algorithms can be easily adopted with different types of features. Several geometric features (points, lines, planes) are considered in this work. In this thesis, the relative mapping approach is adopted for solving the SLAM problem. This approach has many advantages. First, the mapping is decoupled from the estimation of robot pose so that the map estimation is independent from odometry errors. In other words, odometry errors do not affect and accumulate to the map estimate as in the absolute mapping approach. Second, the estimation does not involve the dynamics model of the robot which is identity in a relative mapping algorithm, meaning that only the observation model is considered in the estimation. A relative map has extra consistency problem compared to an absolute map. It is subject to the geometrical consistency problem which may generate an inconsistent absolute map after an transformation. However, having only observation model in the estimation gives an insight to separating nonlinearities from the iterative part of the estimator and thus minimize the effects of linearization errors. In this work, these subjects are investigated and reported. For some service robotic applications, especially for indoor office-like environments, we would like to have a fast, robust and lightweight approach which is capable to perform real-time SLAM on minimal hardware platforms. By exploiting some known knowledge about the structure of the environment, we claim to be able to achieve that goal. Particularly, the OrthoSLAM algorithm has been developed for building 2D and 3D maps. The algorithm adopts the Orthogonality assumption (or constraint) on the environment. First, the complexity of the SLAM algorithm is significantly reduced. Second, the linearization error from the robot heading uncertainty is removed and thus the map consistency is greatly improved. Implementations of the developed algorithms are tested on simulated data, on existing real world datasets and on robot platforms. Existing algorithms used in this work have been also reimplemented. The performance of the algorithms are analysed and compared on well chosen criteria. Particularly, the issues on computational complexity, linearization error, map consistency, map precision, realtime capability are investigated.