# Grey Wolf Resampling-Based Rao-Blackwellized Particle Filter for Mobile Robot Simultaneous Localization and Mapping

Authors: Yong Dai; Ming Zhao
Journal: Journal of Robotics
 (2021)

---

## Abstract

An artificial intelligent grey wolf optimizer (GWO)-assisted resampling scheme is applied to the Rao-Blackwellized particle filter (RBPF) in the simultaneous localization and mapping (SLAM). By doing this, we can make the diversity of the particles resampling and then obtain a better localization accuracy and fast convergence to realize indoor mobile robot SLAM. In addition, we propose an adaptive local data association (Range-SLAM) scheme to improve the computational efficiency for the algorithm of the nearest neighbor (NN) data association in the iteration of the RBPF prediction. Through the experiment and simulations, the proposed SLAM schemes have fast convergence, accuracy, and heuristics. Therefore, the improved RBPF and new data association schemes presented in this paper can provide a feasible method for the indoor mobile robot SLAM.


---

## Body

## 1. Introduction

In a completely unknown environment, the mobile robots just relying on their carrying sensors to get environment information and successfully make simultaneous localization and mapping (SLAM) is a basic step to realize autonomous intelligent navigation [1]. Meanwhile, it is a strategy that could be useful in a wider area of research, such as the motion control agents and microfluidics [2, 3]. Extended Kalman filter (EKF) is the most popular method used in the SLAM [4, 5]. However, the SLAM based on the EKF cannot create a large map and it also has a problem of the data association computation efficiency. Therefore, in recent years, the RBPF [6, 7] has been introduced as an effective method to solve the SLAM problem. The core idea of the RBPF technique is to use a particle filter (PF) and the Kalman filter (KF) to predict features in the map, where each particle represents a robot position and attitude. But there exists a new problem; that is, the particles have difficulty in the proposal distribution selection and resampling. In the SLAM problem, the experience tells us that we can select the robot motion model as the proposal distribution, but the method of PF resampling is still less efficient and accurate. Unfortunately, the resampling technique is more important, which can not only avoid particles degeneracy but also determine the robot localization accuracy. The traditional resampling method only pays attention to the identical distribution (ID) attribute [8] of the particle in the posterior probability prediction but ignores the particle diversity, which leads to poor robot positioning prediction accuracy [9].The contribution of this paper lies in the following: (1) introducing an artificial intelligent grey wolf optimization (GWO)-assisted resampling scheme for making the diversity of particles and (2) proposing an adaptive local data association (Range-SLAM) for NN’s efficiency. The above two schemes solve the most intractable problem of conventional RBPF for SLAM. In our scheme of resampling proposed, it can not only guarantee the ID property but also not lose the diversity of particles. In addition, the proposed new data association method improves the computing efficiency in the RBPF. Therefore, the improved RBPF becomes more effective and flexible in the SLAM.The organization of this paper is as follows: after reviewing the normal RBPF, we explain the Rao-Blackwellized resampling idea in Section3. Sections 4 and 5 introduce the exploration techniques of GWO-assisted resampling. Section 6 describes a new data association method. Finally, Section 7 contains the experimental results carried out on real robots as well as in the simulations. Section 8 concludes this study.


## 2. Rao-Blackwellized Filter Review

According to Murphy [10], the key idea of solving the SLAM problem with a Rao-Blackwellized particle filter (RBPF) is to estimate a posterior pXt|Yt and divide the state vector Xt into two parts: one part is xtp, which is estimated using the PF, and the other part is xtk, where Kalman filters (KFs) are used. Denoting the measurements and states up to time t with Yt=yjj=0t and Xt=xjj=0t, respectively, the joint probability density function (PDF) is given by Bayes’ rule as(1)pxtp,xtk|Yt=pxtk|xtp,Yt︸KFpxtp|Yt︸PF.If the first termpxtk|xtp,Yt is linear, it can be optimally estimated using a KF. To obtain the second term pxtp|Yt, it is necessary to apply nonlinear filtering techniques (the PF will be used). It is clear that the PF can be sampled in a lower dimensional state space (e.g., 3 dimensions), when xtp represents the pose of mobile robot. Then the PF and KF can estimate obstacles in map with a known mobile robot pose.For a mobile robot, the general movement and observation equations can be defined by(2)Xt|t−1=fXt−1|t−1,ut+εt⟶pXt|t−1|Xt−1|t−1,yt=hXt|t−1+ηt⟶pyt|Xt|t−1,where ut is the control signal; εt and ηt represent the Gaussian white noise with 0 mean value and their covariances are Qt and Rt.In the estimation of RBPF-SLAM algorithm, a probability ranging motion model is usually used as the recommended distribution:(3)Xt|t−1∼qxt|xt−1,Yt=pXt|t−1|Xt−1|t−1,where the proposal distribution probability density function q is a sampling density function. Then, the importance weight is calculated to compensate for the difference between the proposal distribution (Sequential Importance Sample, SIS) and the target distribution for the pose of the robot by(4)ωti∝ωt−1ipyt|xtpxt|xt−1qxt|xt−1,Yt=ωt−1ipyt|xt|tki,xt|tpi,Yt−1,which is proportional to a measurement likelihood. Then, the obtained weights are normalized as follows:(5)ωt+1i=ωt+1i∑j=1Nωt+1j.For dividing the state vectorXt into two parts, the model of the state can be decomposed into linear/nonlinear Gaussian system [11, 12] as follows:(6)Xt+1p=fpxtp+Fpxtpxtk+GpXtpwtp,Xt+1k=fkxtp+Fkxtpxtk+GkXtpwtk,yt=hxtp+Hkxtpxtk+et,where the state noise is assumed to be white and Gaussian distributed with(7)ωt=ωtpωik∼N0,Qt,Qt=QtpQtpkQtpkTQtk.The measurement noise is assumed to be white and Gaussian distributed according to(8)et∼N0,Rt.Furthermore,x0p is Gaussian:(9)x0p∼Nx¯0,P¯0.The density ofx0k can be arbitrary, but it is assumed to be known. The Rao-Blackwellization for filtering algorithm is given in Algorithm 1. For the system equation (6), see (7)–(9) for system properties.Algorithm 1:The Rao–Blackwellization for filtering algorithm.
Step 1: initialization. For i = 1, 2, …, N, x0|−1p∼px0pix0p and set x0|−1ki,p0|−1i=x0k,p0, set t=0.Step 2: PF measurement update. For i = 1, 2, …, N, ω˜ti=pyt|xt|tki,xt|tpi,Yt−1 and normalize ωti=ω˜ti/∑jω˜tj.Step 3: resample N particles with replacement. xt|tpj,ωtjj=1N=Resamplext|tpi,ωtii=1N.Step 4: PF time update and KF.(a)
KF measurement update:xt|tki=xt|t−1ki+Ktiyt−hii−Htyixt|t−1kiPt|ti=Pt|t−1i+KtiMtiKtiTMti=HtyiPt|t−1iHtyiT+RKti=Pt|t−1iHtyiTMti−1(b)
PF time update. Fori = 1, 2, …, N, predict new practices xt|t−1pi∼pxt|t−1p|Xtpi,Yt.(c)
PF time update. Setzti=xt−1pi−ftpi.Xt+1|tki=ftki+Ftkixt|tki+Ltizti−Ftpixt|tkiPt+1|ti=FtkiPt|tiFtkiT+GtkiQKGtkiT−LtiNtiLtiTNti=FtpiPt|tiFtpiT+GtpiQpGtpiTLti=FtkiPt|tiFtkiTNti−1Step 5: increase time and repeat from step 2.The resampling method (Sample Importance Resampling, SIR) is [9] to randomly get rid of unimportant particles and replace them with more likely ones. Generate a uniform distribution of random numbers. Let μ˜∼U0,N−1, sw=0, and j=1, where sw is the particle accumulation and the initial value is zero. Detailed algorithm is given in Algorithm 2.Algorithm 2: The resampling algorithm.
xt|tpj,ωtjj=1N=Resamplext|tpi,ωtii=1NNESS,k=∑i=1Nkωt|ti2−1IF1≤NESS,k≤Nk, (PF resampling switches between SIR and SIS)FORi = 1 : Nsw=sw+ωtinum=0 (the number of the i-th particle copied times and the initial value is zero.)WHILEsw>μ˜num=num+1μ˜=μ˜+N−1xt|tpj=xt|tpi;ωtj=1/N;j=j+1END WHILEEND FOREND IF


## 3. Resampling (SIR) Analysis

With the particle filter, if the described RBPF runs with exactly the steps described above, it will end up with all the particle weight in one single value. This will degrade estimation performance, because the normal resampling method above is just sure of ID for resampling (details below) and not sure of diversity of particles. Actually, there are two important factors that affect PF estimation performance: one is the proposal distribution which has been solved by motion modelpXt|t−1|Xt−1|t−1, and the other one is the resampling; let us talk about it in detail.Why resampling? The motivation of resampling includes, but is not limited to, combating sample degeneracy (while avoiding impoverishment) and adjusting the number of particles online, essentially reducing the probability that the filter loses tracking and localization. However, notice that resampling basic principle is abided by ID for resampling as well as the diversity of particles [8, 9].Now a consistent ID metric and the sampling variance are introduced for assessment of the ID attribute of resampling. Discrepancies metric between the numbers of times that the particles are resampled is(10)SV=1M∑m=1MNtm−Nωtm2,where N is the size after resampling, M is the size before resampling, Ntm=floorNωtm, and Floor(·) gives the largest integer not exceeding the content. The smaller the SV is, the better the ID quality of the resampling method is. If and only if the two distributions are exactly the same, the SV given in equation (10) is essentially a cost function that provides an efficient metric to measure the discrepancy between the discrete distributions of weighted particles before and after resampling.From resampling analysis above, the problem of particle weight degeneracy and impoverishment is conventional PF associated and difficult to completely remove. Particle weights will be with serious degradation after using normal resampling (although with a perfect ID), and then particle impoverishment will also be more serious [8], so preventing and solving the dual problem are expected.In order to overcome the problems caused by resampling, this paper designs a kind of intelligent resampling system; namely, in the sampling space, by means of searching optimal algorithm [13], we search particles with the approximate weight of the highest weight of the particle (but not the same as it), to replace the low weight of the particles in degeneracy. It is not like the normal resampling method above to just copy high weight particles (particles are the same). This will not only ensure the diversity of particles but also ensure that all of the weights of the particles have a high probability with SLAM iterations. Now let us firstly introduce a searching optimization algorithm, that is, GWO.


## 4. Grey Wolf Optimization

GWO is a new kind of metaheuristic biological intelligence algorithm proposed by Mirjalili et al. [14]. The process of imitating the hierarchical leadership and hunting mechanism of wolves during natural wolf hunting is shown in Figure 1. For detailed algorithm, we refer the reader to Seyedali’s work.Figure 1
(a) Hunting behavior of grey wolves: (A) chasing, approaching, and tracking prey; (B–D) pursuing, harassing, and encircling; (E) stationary situation and attack. (b) Hierarchy of grey wolf (dominance decreases from top down).
(a)(b)


## 5. Grey Wolf Optimization-Assisted Resampling

When resampling, we must keep particles away from impoverishment and invariability. If the resampling has to be taken when particles get the degeneracy, we give up the least weight particles, instead of just mechanically copying the large weight particle and giving a 1/N weight to each one; we do this as follows.Firstly, we give GWO a searching maximum objective functionF as follows:(11)F=xtHWp−xtp+a⋅e−pYt|xtHWp−pYt|xtp,where a is a constant, xtHWp is the particle with highest weight, and Yt is a known vector that comes from the observation. In the searching algorithm, parameters xtp to be optimized should obtain a clearly defined scope. In this paper, the wolf algorithm searching range is selecting the maximum weight of the particle to be the center and extending to two sides:(12)Xtp=xtp:−λ+xtHWpλ+xtHWp,ytp:−λ+ytHWpλ+ytHWp,θ:−ππ,where λ is an arbitrary constant, which can be used to adjust to enlarging and narrowing the range of variation of particles. Above all, we can find that GWO resampling can keep particles away from impoverishment and invariability, instead of just mechanically copying the large weight particle and giving a 1/N weight to each one.Of course, for the SLAM problem, we should know, inF function, that Yt that comes from the observation should be obtained from data association, and it is also an unavoidable SLAM problem. Let us talk about it in the next section.


## 6. Data Association and its Efficiency Analysis

SLAM refers to a mobile robot in an unknown environment gradually establishing a map of the surrounding environment and determining its own posture. In the SLAM process, the data association is a key issue for real-time map estimation and update based on observational information.If the valid sensor observations correspond to landmarks presented in the map, they can all form a pair of associations to provide new information for SLAM update; if not, sensor observations will be new landmarks stored in the map. There are a lot of data association methods, but the NN data association algorithm based on Mahalanobis distance has been widely used in SLAM [15, 16]. In this paper, we will still use NN data association but improve it. The NN algorithm is described as follows. Perform t + 1 time observation and the NN data association in detail.Assume that the sensor returnsn observations z=z1,z2,…,zn. For n observations, we compute Mahalanobis distance Dni between each zn and each stored landmark LMi, i=1,2,…,M in the map, and D is the minimum of Dni:(13)Dni=Zn−ZpTSt+1|t−1Zn−Zp,D=minDni;i=1,2,…,M,where Zp=hXt+1|tP,Xt+1|tLMi is the expected observation of i-th landmark that existed in map. The innovation covariance matrix for the expected observation is(14)St+1|t=Ht+1|tPt+1|tHt+1|tT+Rt+1|t,where Ht+1|t=∂Zp/∂Xt+1|t is the Jacobian matrix of the system of observation equations. The general assumption is Dni∼χ22. Confidence is given to determine the correlation threshold G1 and augmented threshold G2; if Dni < G1, then LMi and Zn are a set of acceptable association; if there are sets of acceptable association with Zn, then select the landmark with minimum norm distance (ND) to be a set of acceptable associations with Zn, where ND=D+logS; if Dni > G2, then Zn is a new landmark to be stored; if G1 < Dni < G2, then give up Zn, and regard it as noises.


### 6.1. Efficiency Analysis

Assume there areM landmarks in the map right now; from the NN data association analysis, we can see the following:(1)
If there is a new observed landmark by sensor and data association is made in the map, then it will need to computen∗M times with NN to solve the SLAM problem. With the increment of the number of observed new landmarks, M will be expanded largely, and computation is increased.(2)
For PF in RBPF, its dimension of the system state vector is 3, but, unfortunately, the dimension of the system state vector of KF ism, where m represents the existing landmarks in the map right now. In large and complex environment, with the increment of the number of observed new landmarks, the dimension of the system state vector of KF will also increase. Computation of covariance matrix and other matrices will be dramatically increased.To avoid reducing the operating efficiency and localization inaccuracy, we propose a SLAM algorithm with adaptive observation range (Range-SLAM). The principle of the algorithm is to use a circular local map to estimate the position and attitude of mobile robot in the world coordinate system, while updating the local map, as shown in Figure2(a).Figure 2
(a) Observation range; (b) local data association.
(a)(b)In Figure2, S represents circular local map; S1 represents observation range; S2 represents constraint area; black points represent landmarks. First, we need to detect whether there are new landmarks in area S1 by constraint conditions:(15)xreal_k−mjx2+yreal_k−mjy2<R,where Robotreal−position=xreal_kyreal_kT is the robot real position in map. mj=mjxmjyT is the landmark in observation range; R is an adaptive radius scalar. If it is a new landmark, then add it to the system state vector matrix. At the same time, for the number of landmarks NUM in area S, if NUM > NUMmax, then reduce the radius R of circle S; otherwise, if NUM < NUMmin, then increase the radius under the premise of Rmin ≤ R ≤ Rmax.For this purpose, we just do the data association inS space and not in the entire map space of the landmarks with one to one association; at the same time, the KF state vector is also limited to the dimension of the S space. This will greatly reduce the computational complexity of the data association, while a more important thing is to reduce the complexity of the KF in the process of computing. It is just like the memory of a computer; S space only works as the current operation of the domain, and the entire map is like the hard drive; the robot will store and refresh S space landmarks in the process of detecting new landmarks. The proposed method is easy but a valid one; we can finally determine mobile robot position and attitude accurately by RBPF above.


## 6.1. Efficiency Analysis

Assume there areM landmarks in the map right now; from the NN data association analysis, we can see the following:(1)
If there is a new observed landmark by sensor and data association is made in the map, then it will need to computen∗M times with NN to solve the SLAM problem. With the increment of the number of observed new landmarks, M will be expanded largely, and computation is increased.(2)
For PF in RBPF, its dimension of the system state vector is 3, but, unfortunately, the dimension of the system state vector of KF ism, where m represents the existing landmarks in the map right now. In large and complex environment, with the increment of the number of observed new landmarks, the dimension of the system state vector of KF will also increase. Computation of covariance matrix and other matrices will be dramatically increased.To avoid reducing the operating efficiency and localization inaccuracy, we propose a SLAM algorithm with adaptive observation range (Range-SLAM). The principle of the algorithm is to use a circular local map to estimate the position and attitude of mobile robot in the world coordinate system, while updating the local map, as shown in Figure2(a).Figure 2
(a) Observation range; (b) local data association.
(a)(b)In Figure2, S represents circular local map; S1 represents observation range; S2 represents constraint area; black points represent landmarks. First, we need to detect whether there are new landmarks in area S1 by constraint conditions:(15)xreal_k−mjx2+yreal_k−mjy2<R,where Robotreal−position=xreal_kyreal_kT is the robot real position in map. mj=mjxmjyT is the landmark in observation range; R is an adaptive radius scalar. If it is a new landmark, then add it to the system state vector matrix. At the same time, for the number of landmarks NUM in area S, if NUM > NUMmax, then reduce the radius R of circle S; otherwise, if NUM < NUMmin, then increase the radius under the premise of Rmin ≤ R ≤ Rmax.For this purpose, we just do the data association inS space and not in the entire map space of the landmarks with one to one association; at the same time, the KF state vector is also limited to the dimension of the S space. This will greatly reduce the computational complexity of the data association, while a more important thing is to reduce the complexity of the KF in the process of computing. It is just like the memory of a computer; S space only works as the current operation of the domain, and the entire map is like the hard drive; the robot will store and refresh S space landmarks in the process of detecting new landmarks. The proposed method is easy but a valid one; we can finally determine mobile robot position and attitude accurately by RBPF above.


## 7. Experiment

In this paper, we take two wheels’ differential driving mobile robot as an experiment. Its motion model is shown in Figure3. The state of mobile robot of world coordinate system is represented by the position and orientation vector Xk=xk,yk,θkT, where Xk=xk,ykT are coordinates of mobile robot in k moment; θk is the angle between the forward direction of mobile robot and the positive direction of x-axis of the world coordinate system.Figure 3
Model of mobile robot.The linear velocityυk and rotational angular velocity ωk of mobile robot in k moment are(16)υk=υR,k+υL,k2,ωk=υR,k−υL,kL,where υR,k,υL,k are the linear velocities of the right and left wheels; L-axis is the spacing between two wheels. Assuming that the speed of the mobile robot is uniformly changed from k − 1 moment to k moment, the kinematic model of the mobile robot is(17)Xk=xkykθk=xk−1+υk−1+υk2⋅Δt⋅cosθk−1yk−1+υk−1+υk2⋅Δt⋅cosθk−1θk−1+ωk−1+ωk2⋅Δt,where Δt is the sampling period.For the state observation model, in this paper, we set that there are totallyN landmarks and the coordinates mix,mjyT (i = 1, 2, …, N) do not change; then the observation model of mobile robot is(18)Zki=rkiϕki=xk−mix2+yk−miy2arctanmiy−ykmix−xk−θk,where rki is the distance between the mobile robot and landmark i; ϕki is the angle between the forward direction and connection line of mobile robot.


### 7.1. Sensor Features Detection

Sixteen Polaroid sonar sensors are individually with a beam width of 30°. The robot explored the home environment and was manually controlled at an average speed of 0.2 m/s. During this exploration phase, the sonar ring acquired range data at a frequency of 1 Hz (i.e., 16 data sets per 1 s).By testing the SLAM performance of the improved RBPF, we get a successful experiment of robot localization and mapping. In Figure4(a) and Figure 4(b), the black boxes are obstacles located by ultrasonic sensors and they have been mapped by improved RBPF. The blue trajectory is the robot motion localization; light green small arcs are the ultrasonic scanning signs. The average localization error has been compared with other filtering algorithms; with the iterations increase, the proposed improved RBPF has a faster convergence than others, as shown in Figure 5. The improved RBPF in the SLAM problem not only reduces the localization error but also has a faster convergence, because the GWO algorithm is used to assist in the resampling.Figure 4
(a) SLAM experiment 1; (b) SLAM experiment 2.
(a)(b)Figure 5
Average localization error with iterations.When applying the GWO algorithm to assist the resampling, randomly initialize artificial wolves inXtp, its quantity n=200, maximum iterations kmax=100, searching wolves scaling factor α=0.3, maximum number of searches Tmax=20, distance determinant factor ω=50, step length factor S=0.01, updating scaling factor β=0.5, a=10, and λ=20. The before and after resampling particles change trend is shown in Figure 6.Figure 6
GWO-assisted resampling illustration.In Figure6, a large swarm of red particles in degeneracy needs to be resampled, and the resampling method is the GWO; namely, remove the amount of N particles with small weights before resampling and producing the same amount of N particles in the vicinity of the approximate maximum weight of particle to replace the original ones after resampling. The new generation particles are represented by the black dots in Figure 6; the distribution of black dots does not have an ideal distribution but not far away from the maximum weight, since the GWO encircling wolves have a small distance from the leader wolf. Such distribution is enough to satisfy the SV value in a very small range and the change of SV curve shown in Figure 7, and all the results prove that GWO resampling has a good ID quality. The most important result is that GWO resampling not only ensures the diversity of particles but also ensures the particles distribution approximate maximum weight after resampling.Figure 7
GWO resampling SV trend.This paper also proposes a new local data association method; experiments with the adjustment of domain of data association are made, as shown in Figure8. We can see that the proposed method has a successful control of the length of state vector with KF prediction iteration, which simplifies the calculation of complexity and improves the efficiency. The most important thing is that the proposed local data association method in this paper can have a successfully accurate SLAM with localization error controlled in a certain range and also avoid the complexity of normal data association and its endless growth with more new landmarks.Figure 8
Size of the KF state vector.


## 7.1. Sensor Features Detection

Sixteen Polaroid sonar sensors are individually with a beam width of 30°. The robot explored the home environment and was manually controlled at an average speed of 0.2 m/s. During this exploration phase, the sonar ring acquired range data at a frequency of 1 Hz (i.e., 16 data sets per 1 s).By testing the SLAM performance of the improved RBPF, we get a successful experiment of robot localization and mapping. In Figure4(a) and Figure 4(b), the black boxes are obstacles located by ultrasonic sensors and they have been mapped by improved RBPF. The blue trajectory is the robot motion localization; light green small arcs are the ultrasonic scanning signs. The average localization error has been compared with other filtering algorithms; with the iterations increase, the proposed improved RBPF has a faster convergence than others, as shown in Figure 5. The improved RBPF in the SLAM problem not only reduces the localization error but also has a faster convergence, because the GWO algorithm is used to assist in the resampling.Figure 4
(a) SLAM experiment 1; (b) SLAM experiment 2.
(a)(b)Figure 5
Average localization error with iterations.When applying the GWO algorithm to assist the resampling, randomly initialize artificial wolves inXtp, its quantity n=200, maximum iterations kmax=100, searching wolves scaling factor α=0.3, maximum number of searches Tmax=20, distance determinant factor ω=50, step length factor S=0.01, updating scaling factor β=0.5, a=10, and λ=20. The before and after resampling particles change trend is shown in Figure 6.Figure 6
GWO-assisted resampling illustration.In Figure6, a large swarm of red particles in degeneracy needs to be resampled, and the resampling method is the GWO; namely, remove the amount of N particles with small weights before resampling and producing the same amount of N particles in the vicinity of the approximate maximum weight of particle to replace the original ones after resampling. The new generation particles are represented by the black dots in Figure 6; the distribution of black dots does not have an ideal distribution but not far away from the maximum weight, since the GWO encircling wolves have a small distance from the leader wolf. Such distribution is enough to satisfy the SV value in a very small range and the change of SV curve shown in Figure 7, and all the results prove that GWO resampling has a good ID quality. The most important result is that GWO resampling not only ensures the diversity of particles but also ensures the particles distribution approximate maximum weight after resampling.Figure 7
GWO resampling SV trend.This paper also proposes a new local data association method; experiments with the adjustment of domain of data association are made, as shown in Figure8. We can see that the proposed method has a successful control of the length of state vector with KF prediction iteration, which simplifies the calculation of complexity and improves the efficiency. The most important thing is that the proposed local data association method in this paper can have a successfully accurate SLAM with localization error controlled in a certain range and also avoid the complexity of normal data association and its endless growth with more new landmarks.Figure 8
Size of the KF state vector.


## 8. Conclusion

To solve the SLAM problem of mobile robot, this paper adopts an improved RBPF filtering scheme; the important SIR is combined with an artificial intelligent algorithm GWO, which makes the improved RBPF with fast convergence. The most important thing is that the improved RBPF is able to avoid the normal resampling only considering the particles weight ID quality but ignoring the diversity of particles having the significance of the localization of the robot by posterior probability distribution. In addition, this paper also improves the normal NN data association method and proposes a local data association-adaptive observation range (Range-SLAM) which not only reduces the complexity of the data association but also improves the efficiency of the NN algorithm as well as effectively avoiding the KF state vector from unlimited growth and reducing the computation complexity for RBPF-SLAM.



---

*Source: 4978984-2021-10-26.xml*