Abstract
In recent years, various algorithms using random finite sets (RFS) to solve the issue of simultaneous localization and mapping (SLAM) have been proposed. Compared with the traditional method, the advantage of the RFS method is that it can avoid data association, landmark appearance and disappearance, missed detections, and false alarms in Bayesian recursion. There are many problems in the existing robot SLAM methods, such as low estimation accuracy, poor back-end optimization, etc. On the basis of previous studies, this paper presents a labeled random finite set (L-RFS) SLAM method. We describe a scene where the sensor moves along a given path and avoids obstacles based on the L-RFS framework. Then, we use the labeled multi-Bernoulli filter (LMB) to estimate the state of the sensor and feature points. At the same time, the B-spline curve is used to smooth the obstacle avoidance path of the sensor. The effectiveness of the algorithm is verified in the final simulation.
Funder
National Natural Science Foundation of China
Shaanxi province key research and development program
Subject
Electrical and Electronic Engineering,Biochemistry,Instrumentation,Atomic and Molecular Physics, and Optics,Analytical Chemistry
Reference44 articles.
1. Monocular visual SLAM algorithm for autonomous vessel sailing in harbor area;Wang;Proceedings of the 25th Saint Petersburg International Conference on Integrated Navigation Systems (ICINS),2018
2. Orthogonal SLAM: A Step toward Lightweight Indoor Autonomous Navigation;Nguyen;Proceedings of the IEEE/RSJ International Conference on Intelligent Robots & Systems,2006
3. Feature Detection With a Constant FAR in Sparse 3-D Point Cloud Data
4. PFVAE: A Planar Flow-Based Variational Auto-Encoder Prediction Model for Time Series Data
5. Past, Present, and Future of Simultaneous Localization and Mapping: Toward the Robust-Perception Age