Strong Tracking Filter Simultaneous Localization and Mapping 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).

Purpose – To build a persistent map with visual landmarks is one of the most important steps for implementing the visual simultaneous localization and mapping (SLAM). The corner detector is a common method utilized to detect visual landmarks for constructing a map of the environment. However, due to the scale-variant characteristic of corner detection, extensive computational cost is needed to recover the scale and orientation of corner features in SLAM tasks. The purpose of this paper is to build the map using a local invariant feature detector, namely speeded-up robust features (SURF), to detect scale- and orientation-invariant features as well as provide a robust representation of visual landmarks for SLAM. Design/methodology/approach – SURF are scale- and orientation-invariant features which have higher repeatability than that obtained by other detection methods. Furthermore, SURF algorithms have better processing speed than other scale-invariant detection method. The procedures of detection, description and matching of regular SURF algorithms are modified in this paper in order to provide a robust representation of visual landmarks in SLAM. The sparse representation is also used to describe the environmental map and to reduce the computational complexity in state estimation using extended Kalman filter (EKF). Furthermore, the effective procedures of data association and map management for SURF features in SLAM are also designed to improve the accuracy of robot state estimation. Findings – Experimental works were carried out on an actual system with binocular vision sensors to prove the feasibility and effectiveness of the proposed algorithms. EKF SLAM with the modified SURF algorithms was applied in the experiments including the evaluation of accurate state estimation as well as the implementation of large-area SLAM. The performance of the modified SURF algorithms was compared with those obtained by regular SURF algorithms. The results show that the SURF with less-dimensional descriptors is the most suitable representation of visual landmarks. Meanwhile, the integrated system is successfully validated to fulfill the capabilities of visual SLAM system. Originality/value – The contribution of this paper is the novel approach to overcome the problem of recovering the scale and orientation of visual landmarks in SLAM tasks. This research also extends the usability of local invariant feature detectors in SLAM tasks by utilizing its robust representation of visual landmarks. Furthermore, data association and map management designed for SURF-based mapping in this paper also give another perspective for improving the robustness of SLAM systems.

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.

Mobile robot Simultaneous Localization and Mapping (SLAM) problem is one of the most active research areas in robotics. In the research and simulation of SLAM, MATLAB-based simulators are widely used due to their comprehensive functionalities and simple usage. In this paper, the main open source MATLAB-based simulators for SLAM and their properties are listed. Two representative ones are concretely introduced from the aspects of data creation and import, motion model and observation model, and algorithms implementation. Simulation results of these two simulators indicate that MATLAB-based simulators are convenient and helpful in the robot SLAM research when developing new algorithms and when comparing accuracy, consistency or convergence of different algorithms. The SLAM algorithms widely used in MATLAB-based simulators, including Extended Kalman Filter (EKF), Unscented Kalman Filter (UKF) based SLAM algorithm and FastSLAM algorithm, are also introduced.

Simultaneous localization and mapping (SLAM) is a crucial problem to solve the navigation and positioning for an autonomous robot moving in an unknown environment. This work proposes a rank Kalman filter (RKF) SLAM algorithm based on the principle of rank statistic to deal with the robot SLAM. The RKF algorithm can effectively simulate the probability distribution of nonlinear systems by using even rank sample points. The proposed RKF-SLAM is validated in simulations by comparing with two nonlinear filtering SLAM algorithms under the situation that the observation noises distribute to Gaussian distribution or non-Gaussian distribution.

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.

Simultaneous localization and mapping (SLAM) has been investigated in the field of robotics for two decades, as it is considered to be an effective method for solving the positioning and mapping problem in a single framework. In the SLAM community, the Extended Kalman Filter (EKF) based SLAM and particle filter SLAM are the most mature technologies. After years of development, graph-based SLAM is becoming the most promising technology and a lot of progress has been made recently with respect to accuracy and efficiency. No matter which SLAM method is used, loop closure is a vital part for overcoming the accumulated errors. However, in 2D Light Detection and Ranging (LiDAR) SLAM, on one hand, it is relatively difficult to extract distinctive features in LiDAR scans for loop closure detection, as 2D LiDAR scans encode much less information than images; on the other hand, there is also some special mapping scenery, where no loop closure exists. Thereby, in this paper, instead of loop closure detection, we first propose the method to introduce extra control network constraint (CNC) to the back-end optimization of graph-based SLAM, by aligning the LiDAR scan center with the control vertex of the presurveyed control network to optimize all the poses of scans and submaps. Field tests were carried out in a typical urban Global Navigation Satellite System (GNSS) weak outdoor area. The results prove that the position Root Mean Square (RMS) error of the selected key points is 0.3614 m, evaluated with a reference map produced by Terrestrial Laser Scanner (TLS). Mapping accuracy is significantly improved, compared to the mapping RMS of 1.6462 m without control network constraint. Adding distance constraints of the control network to the back-end optimization is an effective and practical method to solve the drift accumulation of LiDAR front-end scan matching.

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.

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³.

This paper presents a seletion procedure for environmet features for the correction stage of a SLAM (Simultaneous Localization and Mapping) algorithm based on an Extended Kalman Filter (EKF). This approach decreases the computational time of the correction stage which allows for real and constant-time implementations of the SLAM. The selection procedure consists in chosing the features the SLAM system state covariance is more sensible to. The entire system is implemented on a mobile robot equipped with a range sensor laser. The features extracted from the environment correspond to lines and corners. Experimental results of the real time SLAM algorithm and an analysis of the processing-time consumed by the SLAM with the feature selection procedure proposed are shown. A comparison between the feature selection approach proposed and the classical sequential EKF-SLAM along with an entropy feature selection approach is also performed.

Simultaneous localization and mapping (SLAM) becomes popular in the autonomous robot research community. SLAM requests a mobile robot, placed at an unknown location in an unknown environment, to incrementally build a consistent map of this environment while simultaneously determining its location within this map. The odometer data is helpful but the noisy error accumulates. Assistant with measurements from the other sensors, SLAM improves the accuracy by filtering. The extended Kalman filter is the most used method to feedback the error. In this thesis, a monocular vision based SLAM for a wheeled robot is proposed. A single web camera is the only measurement input to correct the odometer data. Extract features and match them based on the scale invariant feature transform (SIFT). Absence of the feature depth information is the key issue for the monocular vision in SLAM. The inverse depth parametrization method solves the problem by present the position in inverse coordinate with some reasonable assumptions. Convergence of the feature position is more easily achieved by the EKF due to the linearity. Combining the odometer data with the inverse depth method, this system provides an accurate map by tests of the indoor image sequence.

In this paper we investigate the role of iteration in kalman filters family for improvement of the estimation accuracy of states in Simultaneous Localization and Mapping (SLAM). The linearized error propagation existing in kalman filters family can result in large errors and inconsistency in the SLAM problem. One approach to alleviate this situation is the use of iteration in Extended Kalman Filter (EKF) and Sigma Point Kalman Filter (SPKF). We will describe that the iterated versions of kalman filters can increase the estimation accuracy and robustness of these filters against linear error propagation. Simulation results are presented to validate this improvement of state estimate convergence through repetitive linearization of the nonlinear model in EKFSLAM and SPKFSLAM algorithms.

In this paper, a novel methodology is proposed to solve the simultaneous localization and mapping (SLAM) problem of mobile robot with particle filter (PF) algorithm. Compared with Kalman filter (KF) and extended Kalman filter (EKF), PF has a better performance in non-linear non-Gaussian environments. A close-loop updating scheme is developed in which positions of the robot and landmarks are updated with particle filtering and a weighted averaging algorithm respectively, and are linked through an additional feedback and correction process. An adaptive re-sampling method is used to reduce the computational load. The results of the simulation indicate that the PF-SLAM algorithm can localize the robot and landmarks accurately, and the error of landmarks' estimation converges better than general SLAM algorithms.

The paper presents a robust outdoor stereo vision simultaneous localization and mapping (SLAM) algorithm. It estimates camera pose reliably in outdoor environments with directional sunlight illumination causing shadows and non-uniform scene lighting. The algorithm has been developed to measure a mining rope shovel’s rotation angle about its vertical axis (“swing” axis). A stereo camera is mounted externally to the shovel house (upper revolvable portion of the shovel), with a clear view of the shovel’s lower carbody. As the shovel house swings, the camera revolves with the shovel house in a planar circular orbit, seeing differing views of the carbody top. During the swing, the SLAM algorithm builds a map of observed 3D features on the carbody and simultaneously using these landmarks to estimate the camera position. This estimated camera position is then used to compute the shovel swing angle. Two novel techniques are employed to improve the SLAM algorithm’s robustness in outdoor environments. First, a “Locally Maximal” feature selection technique for Harris corners is used to select features more consistently in non-uniformly illuminated scenes. Another novel technique is the use of 3D “Feature Clusters” as SLAM landmarks rather than individual single features. The Feature Cluster landmarks improve the robustness of the landmark matching and allow significant reduction of the SLAM filter computational cost. This approach of estimating the shovel swing angle has a maximum error of ±1° upon SLAM map convergence. Results demonstrate the improvements of using the novel techniques compared to previous methods.