Niching in Monte Carlo Filtering Algorithms
نویسندگان
چکیده
Nonlinear multimodal filtering problems are usually addressed via Monte Carlo algorithms. These algorithms involve sampling procedures that are similar to proportional selection in genetic algorithms, and that are prone to failure due to genetic drift. This work investigates the feasibility and the relevance of niching strategies in this context. Sharing methods are evaluated experimentally, and prove to be efficient in such issues.
منابع مشابه
Tackling the premature convergence problem in Monte-Carlo localization
Monte-Carlo localization uses particle filtering to estimate the position of the robot. The method is known to suffer from the loss of potential positions when there is ambiguity present in the environment. Since many indoor environments are highly symmetric, this problem of premature convergence is problematic for indoor robot navigation. It is, however, rarely studied in particle filters. We ...
متن کاملNiching Prospects
Although a large number of evolutionary algorithms have been proposed to efficiently treat multimodal problems, it is currently unclear under what conditions they can be faster than iterated local search algorithms. We tackle this question, assuming we had means to efficiently and errorlessly determine the corresponding basin of attraction for each individual (basin identification) by employing...
متن کاملEvaluating Performance of Algorithms in Lung IMRT: A Comparison of Monte Carlo, Pencil Beam, Superposition, Fast Superposition and Convolution Algorithms
Background: Inclusion of inhomogeneity corrections in intensity modulated small fields always makes conformal irradiation of lung tumor very complicated in accurate dose delivery.Objective: In the present study, the performance of five algorithms via Monte Carlo, Pencil Beam, Convolution, Fast Superposition and Superposition were evaluated in lung cancer Intensity Modulated Radiotherapy plannin...
متن کاملEvaluating Quasi-Monte Carlo (QMC) algorithms in blocks decomposition of de-trended
The length of equal minimal and maximal blocks has eected on logarithm-scale logarithm against sequential function on variance and bias of de-trended uctuation analysis, by using Quasi Monte Carlo(QMC) simulation and Cholesky decompositions, minimal block couple and maximal are founded which are minimum the summation of mean error square in Horest power.
متن کاملBeeID: intrusion detection in AODV-based MANETs using artificial Bee colony and negative selection algorithms
Mobile ad hoc networks (MANETs) are multi-hop wireless networks of mobile nodes constructed dynamically without the use of any fixed network infrastructure. Due to inherent characteristics of these networks, malicious nodes can easily disrupt the routing process. A traditional approach to detect such malicious network activities is to build a profile of the normal network traffic, and then iden...
متن کامل