• 제어로봇시스템학회논문지
• /
• 제19권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.

• 로봇학회논문지
• /
• 제3권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.

• Industrial Engineering and Management Systems
• /
• 제15권4호
• /
• pp.318-323
• /
• 2016

In the current study, factors affecting cheese brands products in grocery stores were evaluated with an emphasis on diversity. The sample data were collected from Noushad and Pegah Milk Industry in 2015 and data were extracted, reviewed, and analyzed from 435 grocery stores in Mashhad using seemingly unrelated regression model and particle swarm optimization algorithm. Results showed that optimum amount of Kalleh product diversity is higher than other competitors in the market, and Kalleh UF diversity is 100 to 250 grams, and Kalleh UF diversity with weight of 300 to 500 grams is more than other modes of diversity, and Kalleh brand must remove tin cheese from the market. Sabah Brand also should eliminate its glass and creamy diversity from market, UF diversity is mostly welcomed in market.

• 로봇학회논문지
• /
• 제4권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.

• 한국지능시스템학회논문지
• /
• 제22권4호
• /
• pp.487-493
• /
• 2012

SLAM(Simultaneous Localization And Mapping)은 주변 환경에 대한 지도 작성과 자신의 위치를 인식하는 기법으로 주행 로봇 분야에서 널리 사용되고 있다. FastSLAM(A Factored Solution to the SLAM)은 파티클 필터와 확장형 칼만 필터를 기반으로 한 대표적인 SLAM 기법중의 하나이나, 재추출 단계에서 입자들의 다양성이 상실되는 문제가 제기되고 있다. 본 논문에서는 적합도 공유기법을 사용하여 입자들의 다양성 상실에 관한 문제를 보완하는 방법을 제시하고, 기존의 기법들과 성능을 비교 및 분석한다.

• 제어로봇시스템학회논문지
• /
• 제15권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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권2호
• /
• pp.442-460
• /
• 2021

Nowadays, recommendation systems (RSs) are applied to all aspects of online life. In order to overcome the problem that individuals who do not meet the constraints need to be regenerated when the many-objective evolutionary algorithm (MaOEA) solves the hybrid recommendation model, this paper proposes a many-objective particle swarm optimization algorithm based on multiple criteria (MaPSO-MC). A generation-based fitness evaluation strategy with diversity enhancement (GBFE-DE) and ISDE⁺ are coupled to comprehensively evaluate individual performance. At the same time, according to the characteristics of the model, the regional optimization has an impact on the individual update, and a many-objective evolutionary strategy based on bacterial foraging (MaBF) is used to improve the algorithm search speed. Experimental results prove that this algorithm has excellent convergence and diversity, and can produce accurate, diverse, novel and high coverage recommendations when solving recommendation models.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권4호
• /
• pp.2038-2057
• /
• 2017

Gaussian learning is a new technology in the computational intelligence area. However, this technology weakens the learning ability of a particle swarm and achieves a lack of diversity. Thus, this paper proposes a vector Gaussian learning strategy and presents an effective approach, named particle swarm optimization based on vector Gaussian learning. The experiments show that the algorithm is more close to the optimal solution and the better search efficiency after we use vector Gaussian learning strategy. The strategy adopts vector Gaussian learning to generate the Gaussian solution of a swarm's optimal location, increases the learning ability of the swarm's optimal location, and maintains the diversity of the swarm. The method divides the states into normal and premature states by analyzing the state threshold of the swarm. If the swarm is in the premature category, the algorithm adopts an inertia weight strategy that decreases linearly in addition to vector Gaussian learning; otherwise, it uses a fixed inertia weight strategy. Experiments are conducted on eight well-known benchmark functions to verify the performance of the new approach. The results demonstrate promising performance of the new method in terms of convergence velocity and precision, with an improved ability to escape from a local optimum.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권5호
• /
• pp.1588-1603
• /
• 2014

In space diversity combining, conventional methods such as maximal ratio combining (MRC), equal gain combining (EGC) and selection combining (SC) are commonly used to improve the output signal-to-noise ratio (SNR) provided that the channel is perfectly estimated at the receiver. However, in practice, channel estimation is often imperfect and this indeed deteriorates the system performance. In this paper, diversity combining techniques based on two evolutionary algorithms, namely genetic algorithm (GA) and particle swarm optimization (PSO) are proposed and compared. Numerical results indicate that the proposed methods outperform the conventional MRC, EGC and SC methods when the channel estimation is imperfect while it shows similar performance as that of MRC when the channel is perfectly estimated.

• Journal of Electrical Engineering and Technology
• /
• 제9권6호
• /
• pp.2107-2113
• /
• 2014

Particle filtering (PF) has shown its outperforming results compared to that of classical Kalman filtering (KF), particularly for highly nonlinear problems. However, PF may not be universally superior to the extended KF (EKF) although the case (i.e. an example that the EKF outperforms PF) is seldom reported in the literature. Particularly, PF approaches show degraded performance for problems where the state noise is very small or zero. This is because particles become identical within a few iterations, which is so called particle impoverishment (PI) phenomenon; consequently, no matter how many particles are employed, we do not have particle diversity regardless of if the impoverished particle is close to the true state value or not. In this paper, we investigate this PI phenomenon, and show an example problem where a classical KF approach outperforms PF approaches in terms of mean squared error (MSE) criterion. Furthermore, we compare the processing speed of the EKF and PF approaches, and show the better speed performance of classical EKF approaches. Therefore, PF approaches may not be always better option than the classical EKF for nonlinear problems. Specifically, we show the outperforming result of unscented Kalman filter compared to that of PF approaches (which are shown in Fig. 7(c) for processing speed performance, and Fig. 6 for MSE performance in the paper).