• Journal of Advanced Navigation Technology
• /
• v.15 no.4
• /
• pp.556-561
• /
• 2011

It is generally known that particle filters can produce consistent target tracking performance in comparison to the Kalman filter for non-linear and non-Gaussian systems. In this paper, I propose a Rao-Blackwellized multiple model particle filter(RBMMPF) to enhance computational efficiency of the particle filters as well as to reduce sensitivity of modeling. Despite that the Rao-Blackwellized particle filter needs less particles than general particle filter, it has a similar tracking performance with a less computational load. Comparison results for performance is listed for the using single sensor information RBMMPF and using multisensor data fusion RBMMPF.

• The Journal of Korea Robotics Society
• /
• v.4 no.2
• /
• pp.97-104
• /
• 2009

Recently, simultaneous localization and mapping (SLAM) approaches employing Rao-Blackwellized particle filter (RBPF) have shown good results. However, due to the usage of the accurate sensors, distinct particles which compensate one another are attenuated as the RBPF-SLAM continues. To avoid this particle depletion, we propose the strategic games to assign the particle's payoff which replaces the importance weight in the current RBPF-SLAM framework. From simulation works, we show that RBPF-SLAM with the strategic games is inconsistent in the pessimistic way, which is different from the existing optimistic RBPF-SLAM. In addition, first, the estimation errors with applying the strategic games are much less than those of the standard RBPF-SLAM, and second, the particle depletion is alleviated.

• The Journal of Korea Robotics Society
• /
• v.3 no.4
• /
• pp.308-314
• /
• 2008

Recently, simultaneous localization and mapping (SLAM) approaches employing Rao-Blackwellized particle filter (RBPF) have shown good results. However, no research is conducted to analyze the result representation of SLAM using RBPF (RBPF-SLAM) when particle diversity is preserved. After finishing the particle filtering, the results such as a map and a path are stored in the separate particles. Thus, we propose several result representations and provide the analysis of the representations. For the analysis, estimation errors and their variances, and consistency of RBPF-SLAM are dealt in this study. According to the simulation results, combining data of each particle provides the better result with high probability than using just data of a particle such as the highest weighted particle representation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06b
• /
• pp.151-153
• /
• 2006

we present a method of sequential speech enhancement, where we infer clean speech signal using a Rao-Blackwellized particle filter (RBPF), given a noise-contaminated observed signal. In contrast to Kalman filtering-based methods, we consider a non-Gaussian speech generative model that is based on the generalized auto-regressive (GAR) model. Model parameters are learned by a sequential Newton-Raphson expectation maximization (SNEM), incorporating the RBPF. Empirical comparison to Kalman filter, confirms the high performance of the proposed method.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.8
• /
• pp.682-687
• /
• 2013

Navigation is a crucial capability for all types of manned or unmanned vehicles. However, vehicle navigation in underwater environments still remains a challenging problem since GPS signals for position fixes are not available in the water. Terrain-referenced underwater navigation is an alternative navigation technique that utilizes geometric information of the subsea terrain to correct drift errors due to dead-reckoning or inertial navigation. Terrain-referenced navigation requires the description of an undulating terrain surface as a mathematical function or table, which often leads to a highly nonlinear estimation problem. Recently, PFs (Particle Filters), which do not require any restrictive assumptions about the system dynamics and uncertainty distributions, have been widely used for nonlinear filtering applications. However, PF has considerable computational requirements which used to limit its applicability to problems of relatively low state dimensions. This study proposes the use of a Rao-Blackwellized particle filter that is computationally more efficient than the standard PF for terrain-referenced underwater navigation involving a moderate number of states, and its performance is compared with that of the extended Kalman filter algorithm. The validity and feasibility of the proposed algorithm is demonstrated through numerical simulations.

• The Journal of Korea Robotics Society
• /
• v.4 no.4
• /
• pp.305-311
• /
• 2009

FastSLAM is a factored solution to SLAM problem using a Rao-Blackwellized particle filter. In this paper, we propose a practical FastSLAM implementation method using an infrared camera for indoor environments. The infrared camera is equipped on a Pioneer3 robot and looks upward direction to the ceiling which has infrared tags with the same height. The infrared tags are detected with theinfrared camera as measurements, and the Nearest Neighbor method is used to solve the unknown data association problem. The global map is successfully built and the robot pose is predicted in real time by the FastSLAM2.0 algorithm. The experiment result shows the accuracy and robustness of the proposed method in practical indoor environment.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.1
• /
• pp.40-47
• /
• 2010

This paper presents a simultaneous localization and mapping (SLAM) of an indoor hallway environment using Rao-Blackwellized particle filter (RBPF) along with a line segment as a landmark. Based on the fact that fluent line features can be extracted around the ceiling and side walls of hallway using vision sensor, a horizontal line segment is extracted from an edge image using Hough transform and is also tracked continuously by an optical flow method. A successive observation of a line segment gives initial state of the line in 3D space. For data association, registered feature and observed feature are matched in image space through a degree of overlap, an orientation of line, and a distance between two lines. Experiments show that a compact environmental map can be constructed with small number of horizontal line features in real-time.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.6
• /
• pp.619-625
• /
• 2009

FastSLAM which uses the Rao-Blackwellized particle filter is one of the famous solutions to SLAM (Simultaneous Localization and Mapping) problem that estimates concurrently a robot's pose and surrounding environment. However, the particle depletion problem arises from the loss of the particle diversity in the resampling process of FastSLAM. Then, the performance of FastSLAM degenerates over the time. In this work, DIR (Density Information-based Resampling) technique is proposed to solve the particle depletion problem. First, the cluster is constructed based on the density of each particle, and the density of each cluster is computed. After that, the number of particles to be reserved in each cluster is determined using a linear method based on the distance between the highest density cluster and each cluster. Finally, the resampling process is performed by rejecting the particles which are not selected to be reserved in each cluster. The performance of the DIR proposed to solve the particle depletion problem in FastSLAM was verified in computer simulations, which significantly reduced both the RMS position error and the feature error.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.10
• /
• pp.907-914
• /
• 2013

A FastSLAM is an algorithm for SLAM (Simultaneous Localization and Mapping) using a Rao-Blackwellized particle filter and its performance is known to degenerate over time due to the loss of particle diversity, mainly caused by the particle depletion problem in the resampling phase. In this paper, the GeSPIR (Geographically Stratified Particle Information-based Resampling) technique is proposed to solve the particle depletion problem. The proposed algorithm consists of the following four steps : the first step involves the grouping of particles divided into K regions, the second obtaining the normal weight of each region, the third specifying the protected areas, and the fourth resampling using regional equalization weight. Simulations show that the proposed algorithm obtains lower RMS errors in both robot and feature positions than the conventional FastSLAM algorithm.