一种新的MCMC粒子滤波器:分层处理MCMC算法的重采样

Jun Tian, Yu Liang, Jiansheng Qian
{"title":"一种新的MCMC粒子滤波器:分层处理MCMC算法的重采样","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":"{\"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}","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

摘要

本文提出了一种分层反作用MCMC重采样算法来处理样本贫化问题。新方法的基本思想是将所有粒子调整到状态空间的高似然区域,而不是将权重大的粒子相乘,剔除权重小的粒子,有效地避免了样本的贫化。在该方法中,将突变算子和粒子群优化(PSO)作为MCMC的过渡核应用于每个粒子,从而促进粒子在状态空间中可能的位移到更好的位置,直到收敛到目标后验密度。最后,通过计算机仿真验证了该方法的有效性。Keywords-particle过滤器;突变;算法;马尔可夫链蒙特卡罗;样本贫化;重采样
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A New MCMC Particle Filter: Re-sampling Form the Layered Transacting MCMC Algorithm
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
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信