2014
DOI: 10.1017/s0263574714002264
|View full text |Cite
|
Sign up to set email alerts
|

Relational FastSLAM: an improved Rao-Blackwellized particle filtering framework using particle swarm characteristics

Abstract: SUMMARYThis paper presents an improved Rao-Blackwellized particle filtering framework with consideration of the particle swarm characteristics in FastSLAM, called Relational FastSLAM or R-FastSLAM. The R-FastSLAM seeks to cope with the inherent problems of FastSLAM, i.e., a particle depletion problem and an error accumulation problem in large environments. The R-FastSLAM uses the particle swarm characteristics in calculating the importance weight and maintaining a particle formation. We assign more accurate we… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
3
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 13 publications
0
3
0
Order By: Relevance
“…Ye [20] proposed a random weight PSO strategy to improve the FastSLAM algorithm, to avoid particle degeneracy and maintain particle diversity. Seung [21] proposed a relational FastSLAM approach that integrated the PSO algorithm into the calculation of the weights and formation of the particles. Zuo [22] proposed a new FastSLAM method based on quantum-behaved PSO to improve the proposal distribution of particles and optimise the estimated particles.…”
Section: Introductionmentioning
confidence: 99%
“…Ye [20] proposed a random weight PSO strategy to improve the FastSLAM algorithm, to avoid particle degeneracy and maintain particle diversity. Seung [21] proposed a relational FastSLAM approach that integrated the PSO algorithm into the calculation of the weights and formation of the particles. Zuo [22] proposed a new FastSLAM method based on quantum-behaved PSO to improve the proposal distribution of particles and optimise the estimated particles.…”
Section: Introductionmentioning
confidence: 99%
“…19,20 To overcome the above-mentioned limitations, there are many attempts that apply some biological evolution algorithms. Genetic algorithm 21 and particle swarm optimization (PSO) [22][23][24] are two commonly used methods to maintain the diversity of particles before resampling step. In Ref.…”
Section: Introductionmentioning
confidence: 99%
“…In Ref. [24], PSO is adopted to solve the impoverishment problems and particle depletion. In this paper, the particles optimize after resampling and directly maintain the sufficient number of particles which contributes to estimating the robot pose accurately.…”
Section: Introductionmentioning
confidence: 99%