scholarly journals Posterior Elimination Fast Look-Ahead Rao-Blackwellized Particle Filtering for Simultaneous Localization and Mapping

2016 ◽  
Vol 86 ◽  
pp. 261-264 ◽  
Author(s):  
Surasak Nasuriwong ◽  
Peerapol Yuvapoositanon
Keyword(s):  
Particle Filtering ◽  
Simultaneous Localization And Mapping ◽  
Look Ahead ◽  
Localization And Mapping

Gaussian Kernel Posterior Elimination for Fast Look-Ahead Rao-Blackwellised Particle Filtering for SLAM

2015 ◽  
Vol 781 ◽  
pp. 555-558
Author(s):  
Surasak Nasuriwong ◽  
Peerapol Yuwapoositanon
Keyword(s):  
Particle Filtering ◽  
Simultaneous Localization And Mapping ◽  
Gaussian Kernel ◽  
Fast Computation ◽  
Look Ahead ◽  
Localization And Mapping ◽  
Simulation Results ◽  
Slam Algorithm ◽  
The Look ◽  
Probabilistic Robotics

In this paper, we explore a method for posterior elimination for fast computation of the look-ahead Rao-Blackwellised Particle Filtering (Fast la-RBPF) algorithm for the simultaneous localization and mapping (SLAM) problem in the probabilistic robotics framework. In the case when a lot of SLAM states need to be estimated, large posterior states associated with the correct state may be outnumbered by multiple non-zero smaller posteriors. We show that by masking the low posterior weight states with a Gaussian kernel prior to weight selection the accuracy of the la-RBPF SLAM algorithm can be improved. Simulation results reveal that integrated with the proposed method the fast la-RBPF SLAM performance is enhanced over both the existing RBPF SLAM and the unmodified la-RBPF SLAM algorithms.

scholarly journals δ-Generalized Labeled Multi-Bernoulli Simultaneous Localization and Mapping with an Optimal Kernel-Based Particle Filtering Approach

Sensors ◽  
2019 ◽  
Vol 19 (10) ◽  
pp. 2290 ◽  
Author(s):  
Diluka Moratuwage ◽  
Martin Adams ◽  
Felipe Inostroza
Keyword(s):  
Particle Filter ◽  
Particle Filtering ◽  
State Of The Art ◽  
Data Association ◽  
Simultaneous Localization And Mapping ◽  
Probability Hypothesis Density ◽  
Localization And Mapping ◽  
Optimal Kernel ◽  
Over Time ◽  
Map Management

Under realistic environmental conditions, heuristic-based data association and map management routines often result in divergent map and trajectory estimates in robotic Simultaneous Localization And Mapping (SLAM). To address these issues, SLAM solutions have been proposed based on the Random Finite Set (RFS) framework, which models the map and measurements such that the usual requirements of external data association routines and map management heuristics can be circumvented and realistic sensor detection uncertainty can be taken into account. Rao–Blackwellized particle filter (RBPF)-based RFS SLAM solutions have been demonstrated using the Probability Hypothesis Density (PHD) filter and subsequently the Labeled Multi-Bernoulli (LMB) filter. In multi-target tracking, the LMB filter, which was introduced as an efficient approximation to the computationally expensive δ -Generalized LMB ( δ -GLMB) filter, converts its representation of an LMB distribution to δ -GLMB form during the measurement update step. This not only results in a loss of information yielding inferior results (compared to the δ -GLMB filter) but also fails to take computational advantages in parallelized implementations possible with RBPF-based SLAM algorithms. Similar to state-of-the-art random vector-valued RBPF solutions such as FastSLAM and MH-FastSLAM, the performances of all RBPF-based SLAM algorithms based on the RFS framework also diverge from ground truth over time due to random sampling approaches, which only rely on control noise variance. Further, the methods lose particle diversity and diverge over time as a result of particle degeneracy. To alleviate this problem and further improve the quality of map estimates, a SLAM solution using an optimal kernel-based particle filter combined with an efficient variant of the δ -GLMB filter ( δ -GLMB-SLAM) is presented. The performance of the proposed δ -GLMB-SLAM algorithm, referred to as δ -GLMB-SLAM2.0, was demonstrated using simulated datasets and a section of the publicly available KITTI dataset. The results suggest that even with a limited number of particles, δ -GLMB-SLAM2.0 outperforms state-of-the-art RBPF-based RFS SLAM algorithms.

scholarly journals A survey: which features are required for dynamic visual simultaneous localization and mapping?

2021 ◽  
Vol 4 (1) ◽  
Author(s):  
Zewen Xu ◽  
Zheng Rong ◽  
Yihong Wu
Keyword(s):  
Simultaneous Localization And Mapping ◽  
Dynamic Environments ◽  
Visual Features ◽  
Advantages And Disadvantages ◽  
Intelligent Robots ◽  
Localization And Mapping ◽  
High Level ◽  
Static World ◽  
Robotic Applications ◽  
Significant Attention

AbstractIn recent years, simultaneous localization and mapping in dynamic environments (dynamic SLAM) has attracted significant attention from both academia and industry. Some pioneering work on this technique has expanded the potential of robotic applications. Compared to standard SLAM under the static world assumption, dynamic SLAM divides features into static and dynamic categories and leverages each type of feature properly. Therefore, dynamic SLAM can provide more robust localization for intelligent robots that operate in complex dynamic environments. Additionally, to meet the demands of some high-level tasks, dynamic SLAM can be integrated with multiple object tracking. This article presents a survey on dynamic SLAM from the perspective of feature choices. A discussion of the advantages and disadvantages of different visual features is provided in this article.

scholarly journals Research on Laser-Visual Fusion-based Simultaneous Localization and Mapping

2020 ◽  
Vol 1682 ◽  
pp. 012049
Author(s):  
Jianjie Zhenga ◽  
Haitao Zhang ◽  
Kai Tang ◽  
Weidi Kong
Keyword(s):  
Simultaneous Localization And Mapping ◽  
Localization And Mapping

scholarly journals Modelling Software Architecture for Visual Simultaneous Localization and Mapping

Automation ◽  
2021 ◽  
Vol 2 (2) ◽  
pp. 48-61
Author(s):  
Bhavyansh Mishra ◽  
Robert Griffin ◽  
Hakki Erhan Sevil
Keyword(s):  
System Integration ◽  
Ad Hoc ◽  
Simultaneous Localization And Mapping ◽  
Software Systems ◽  
Model Driven ◽  
Performance Improvements ◽  
Software Model ◽  
Localization And Mapping ◽  
Stereo Cameras ◽  
Core Components

Visual simultaneous localization and mapping (VSLAM) is an essential technique used in areas such as robotics and augmented reality for pose estimation and 3D mapping. Research on VSLAM using both monocular and stereo cameras has grown significantly over the last two decades. There is, therefore, a need for emphasis on a comprehensive review of the evolving architecture of such algorithms in the literature. Although VSLAM algorithm pipelines share similar mathematical backbones, their implementations are individualized and the ad hoc nature of the interfacing between different modules of VSLAM pipelines complicates code reuseability and maintenance. This paper presents a software model for core components of VSLAM implementations and interfaces that govern data flow between them while also attempting to preserve the elements that offer performance improvements over the evolution of VSLAM architectures. The framework presented in this paper employs principles from model-driven engineering (MDE), which are used extensively in the development of large and complicated software systems. The presented VSLAM framework will assist researchers in improving the performance of individual modules of VSLAM while not having to spend time on system integration of those modules into VSLAM pipelines.

Sign in / Sign up

Export Citation Format

Share Document