2018
DOI: 10.1051/matecconf/201816101004
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive particle filter for localization problem in service robotics

Abstract: Abstract. In this paper we present a statistical approach to the likelihood computation and adaptive resampling algorithm for particle filters using low cost ultrasonic sensors in the context of service robotics. This increases the efficiency of the particle filter in the Monte Carlo Localization problem by means of preventing sample impoverishment and ensuring it converges towards the most likely particle and simultaneously keeping less likely ones by systematic resampling. Proposed algorithms were developed … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
4
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 10 publications
(5 citation statements)
references
References 9 publications
0
4
0
Order By: Relevance
“… is the set of all states up to time step k. In [14] the associated importance weight of the particle is defined as follows:…”
Section: Particle Filtermentioning
confidence: 99%
“… is the set of all states up to time step k. In [14] the associated importance weight of the particle is defined as follows:…”
Section: Particle Filtermentioning
confidence: 99%
“…In the above equations R k represent the covariance matrix, n a = 2n, and v = √ n + λ as can be seen in equation (10). After calculating the sigma points and time updates, the measurement update and measurement noise are calculated.…”
Section: A Localization Through Unscented Kalman Filtermentioning
confidence: 99%
“…PF was first introduced in 1999, [10] in a localization context by the name of Monte Carlo Localization (MCL). In this situation, PF proposed a probabilistic method on how to evaluate the robot state in a prior defined map.…”
Section: Introductionmentioning
confidence: 99%
“…The algorithm takes in consideration change in weight and change in standard deviation in order to cover kidnapping before and after convergence of the robot's pose and with independence to the success of the recovery. Heilig et al 25 proposed a statistical approach to the weighting step, taking in consideration present and past standard deviation of the particles, which are also used to detect the kidnapping event, being able to recover with the introduced adaptive resampling, where the number of particles and covariance change depending on the system's confidence about the robot's pose.…”
Section: Related Workmentioning
confidence: 99%