{"title":"A New MCMC Particle Filter: Re-sampling Form the Layered Transacting MCMC Algorithm","authors":"Jun Tian, Yu Liang, Jiansheng Qian","doi":"10.1109/ICGEC.2010.227","DOIUrl":null,"url":null,"abstract":"In this paper, a new method, named layered trans- acting MCMC Resampling algorithm, is proposed to handle the sample impoverishment problem. The basic idea of the new method is to adjust all particles to the high likelihood areas in state-space rather than multiplying particles with high weights and eliminating particles with small weights, which avoids sample impoverishment effectively. In the proposed method, mutation operator and Particle Swarm Optimization (PSO), which considered as transition kernels of MCMC, applied to each particle, and this promotes a possible displacement of the particles to a better location in the state-space until converging to target posterior density. Finally,a computer simulation is performed to show the effectiveness of the proposed method. Keywords-particle filter; mutation; PSO; Markov Chain Monte Carlo; sample impoverishment;resampling","PeriodicalId":373949,"journal":{"name":"2010 Fourth International Conference on Genetic and Evolutionary Computing","volume":"106 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Fourth International Conference on Genetic and Evolutionary Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICGEC.2010.227","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
In this paper, a new method, named layered trans- acting MCMC Resampling algorithm, is proposed to handle the sample impoverishment problem. The basic idea of the new method is to adjust all particles to the high likelihood areas in state-space rather than multiplying particles with high weights and eliminating particles with small weights, which avoids sample impoverishment effectively. In the proposed method, mutation operator and Particle Swarm Optimization (PSO), which considered as transition kernels of MCMC, applied to each particle, and this promotes a possible displacement of the particles to a better location in the state-space until converging to target posterior density. Finally,a computer simulation is performed to show the effectiveness of the proposed method. Keywords-particle filter; mutation; PSO; Markov Chain Monte Carlo; sample impoverishment;resampling