<i>δ</i>-Generalized Labeled Multi-Bernoulli Simultaneous Localization and Mapping with an Optimal Kernel-Based Particle Filtering Approach

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

Full description

Bibliographic Details
Main Authors: Diluka Moratuwage, Martin Adams, Felipe Inostroza
Format: Article
Language:English
Published: MDPI AG 2019-05-01
Series:Sensors
Subjects:
Online Access:https://www.mdpi.com/1424-8220/19/10/2290
_version_ 1798043498762469376
author Diluka Moratuwage
Martin Adams
Felipe Inostroza
author_facet Diluka Moratuwage
Martin Adams
Felipe Inostroza
author_sort Diluka Moratuwage
collection DOAJ
description 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&#8722;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 <inline-formula> <math display="inline"> <semantics> <mi>&#948;</mi> </semantics> </math> </inline-formula>-Generalized LMB (<inline-formula> <math display="inline"> <semantics> <mi>&#948;</mi> </semantics> </math> </inline-formula>-GLMB) filter, converts its representation of an LMB distribution to <inline-formula> <math display="inline"> <semantics> <mi>&#948;</mi> </semantics> </math> </inline-formula>-GLMB form during the measurement update step. This not only results in a loss of information yielding inferior results (compared to the <inline-formula> <math display="inline"> <semantics> <mi>&#948;</mi> </semantics> </math> </inline-formula>-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 <inline-formula> <math display="inline"> <semantics> <mi>&#948;</mi> </semantics> </math> </inline-formula>-GLMB filter (<inline-formula> <math display="inline"> <semantics> <mi>&#948;</mi> </semantics> </math> </inline-formula>-GLMB-SLAM) is presented. The performance of the proposed <inline-formula> <math display="inline"> <semantics> <mi>&#948;</mi> </semantics> </math> </inline-formula>-GLMB-SLAM algorithm, referred to as <inline-formula> <math display="inline"> <semantics> <mi>&#948;</mi> </semantics> </math> </inline-formula>-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, <inline-formula> <math display="inline"> <semantics> <mi>&#948;</mi> </semantics> </math> </inline-formula>-GLMB-SLAM2.0 outperforms state-of-the-art RBPF-based RFS SLAM algorithms.
first_indexed 2024-04-11T22:49:45Z
format Article
id doaj.art-797615fbd0f44c6ca66f44bb661ce676
institution Directory Open Access Journal
issn 1424-8220
language English
last_indexed 2024-04-11T22:49:45Z
publishDate 2019-05-01
publisher MDPI AG
record_format Article
series Sensors
spelling doaj.art-797615fbd0f44c6ca66f44bb661ce6762022-12-22T03:58:37ZengMDPI AGSensors1424-82202019-05-011910229010.3390/s19102290s19102290<i>δ</i>-Generalized Labeled Multi-Bernoulli Simultaneous Localization and Mapping with an Optimal Kernel-Based Particle Filtering ApproachDiluka Moratuwage0Martin Adams1Felipe Inostroza2Department of Electrical Engineering &amp; Advanced Mining Technology Center Universidad de Chile, 837-0451 Santiago, ChileDepartment of Electrical Engineering &amp; Advanced Mining Technology Center Universidad de Chile, 837-0451 Santiago, ChileDepartment of Electrical Engineering Universidad de Chile, 837-0451 Santiago, ChileUnder 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&#8722;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 <inline-formula> <math display="inline"> <semantics> <mi>&#948;</mi> </semantics> </math> </inline-formula>-Generalized LMB (<inline-formula> <math display="inline"> <semantics> <mi>&#948;</mi> </semantics> </math> </inline-formula>-GLMB) filter, converts its representation of an LMB distribution to <inline-formula> <math display="inline"> <semantics> <mi>&#948;</mi> </semantics> </math> </inline-formula>-GLMB form during the measurement update step. This not only results in a loss of information yielding inferior results (compared to the <inline-formula> <math display="inline"> <semantics> <mi>&#948;</mi> </semantics> </math> </inline-formula>-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 <inline-formula> <math display="inline"> <semantics> <mi>&#948;</mi> </semantics> </math> </inline-formula>-GLMB filter (<inline-formula> <math display="inline"> <semantics> <mi>&#948;</mi> </semantics> </math> </inline-formula>-GLMB-SLAM) is presented. The performance of the proposed <inline-formula> <math display="inline"> <semantics> <mi>&#948;</mi> </semantics> </math> </inline-formula>-GLMB-SLAM algorithm, referred to as <inline-formula> <math display="inline"> <semantics> <mi>&#948;</mi> </semantics> </math> </inline-formula>-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, <inline-formula> <math display="inline"> <semantics> <mi>&#948;</mi> </semantics> </math> </inline-formula>-GLMB-SLAM2.0 outperforms state-of-the-art RBPF-based RFS SLAM algorithms.https://www.mdpi.com/1424-8220/19/10/2290SLAMroboticstrackingrandom finite sets
spellingShingle Diluka Moratuwage
Martin Adams
Felipe Inostroza
<i>δ</i>-Generalized Labeled Multi-Bernoulli Simultaneous Localization and Mapping with an Optimal Kernel-Based Particle Filtering Approach
Sensors
SLAM
robotics
tracking
random finite sets
title <i>δ</i>-Generalized Labeled Multi-Bernoulli Simultaneous Localization and Mapping with an Optimal Kernel-Based Particle Filtering Approach
title_full <i>δ</i>-Generalized Labeled Multi-Bernoulli Simultaneous Localization and Mapping with an Optimal Kernel-Based Particle Filtering Approach
title_fullStr <i>δ</i>-Generalized Labeled Multi-Bernoulli Simultaneous Localization and Mapping with an Optimal Kernel-Based Particle Filtering Approach
title_full_unstemmed <i>δ</i>-Generalized Labeled Multi-Bernoulli Simultaneous Localization and Mapping with an Optimal Kernel-Based Particle Filtering Approach
title_short <i>δ</i>-Generalized Labeled Multi-Bernoulli Simultaneous Localization and Mapping with an Optimal Kernel-Based Particle Filtering Approach
title_sort i δ i generalized labeled multi bernoulli simultaneous localization and mapping with an optimal kernel based particle filtering approach
topic SLAM
robotics
tracking
random finite sets
url https://www.mdpi.com/1424-8220/19/10/2290
work_keys_str_mv AT dilukamoratuwage idigeneralizedlabeledmultibernoullisimultaneouslocalizationandmappingwithanoptimalkernelbasedparticlefilteringapproach
AT martinadams idigeneralizedlabeledmultibernoullisimultaneouslocalizationandmappingwithanoptimalkernelbasedparticlefilteringapproach
AT felipeinostroza idigeneralizedlabeledmultibernoullisimultaneouslocalizationandmappingwithanoptimalkernelbasedparticlefilteringapproach