Particles resampling scheme using regularized optimal transport for sequential Monte Carlo filters

被引:4
|
作者
Kang, Chang Ho [1 ]
Park, Chan Gook [1 ]
机构
[1] Seoul Natl Univ, Dept Mech & Aerosp Engn, Seoul 08826, South Korea
关键词
ensemble transform particle filter; Kullback-Leibler divergence; modified Sinkhorn-Knopp algorithm; regularized optimal transport; the resampling method of the particle filter; SAMPLE-SIZE; CONVERGENCE; ALGORITHM;
D O I
10.1002/acs.2918
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A resampling method is presented for improving the performance of particle filters by using adaptive numbers of the resampling particles. The proposed method replaces the resampling step of a sequential importance resampling particle filter with regularized optimal transport that makes use of the transport plan to warp a posteriori weights into desired weights. The basis of the method is the same as an ensemble transform particle filter that uses the linear transformation step in the resampling of particles. However, the linear transformation step in ensemble transform particle filter is computationally expensive and needs relaxation matching between the two samples for robust processing. Furthermore, its performance can be degraded if the number of the effective particles becomes below the required number of particles, which represents the needed particle number of importance sampling. Therefore, in this paper, a regularized optimal transport method is used to deal with computational load reduction and relaxation matching in the resampling step by using a modified Sinkhorn-Knopp algorithm that considers the process iteration rate convergence. In order to maintain the proper number of the effective particles for states estimation, Kullback-Leibler distance sampling method is also implemented in the resampling process. The proposed method is evaluated by theoretical analysis including simple simulations compared with the conventional resampling methods. According to the simulations, the proposed method indicates that estimation accuracy is better than conventional methods with small number of the effective particles.
引用
收藏
页码:1393 / 1402
页数:10
相关论文
共 50 条
  • [31] A New Point Kernel Sampling Scheme and Monte Carlo Transport
    Avez, Benoit
    Bindel, Laurent
    ICRS-13 & RPSD-2016, 13TH INTERNATIONAL CONFERENCE ON RADIATION SHIELDING & 19TH TOPICAL MEETING OF THE RADIATION PROTECTION AND SHIELDING DIVISION OF THE AMERICAN NUCLEAR SOCIETY - 2016, 2017, 153
  • [32] Acceleration scheme for particle transport in kinetic Monte Carlo methods
    Kaiser, Waldemar
    Goesswein, Manuel
    Gagliardi, Alessio
    JOURNAL OF CHEMICAL PHYSICS, 2020, 152 (17):
  • [33] MONTE-CARLO BIASING SCHEME FOR ADJOINT PHOTON TRANSPORT
    DEMATTEIS, A
    SIMONINI, R
    NUCLEAR SCIENCE AND ENGINEERING, 1978, 67 (03) : 309 - 316
  • [34] Online Motion Synthesis Using Sequential Monte Carlo
    Hamalainen, Perttu
    Eriksson, Sebastian
    Tanskanen, Esa
    Kyrki, Ville
    Lehtinen, Jaakko
    ACM TRANSACTIONS ON GRAPHICS, 2014, 33 (04):
  • [35] Inverse kinematics using sequential Monte Carlo methods
    Courty, Nicolas
    Arnaud, Elise
    ARTICULATED MOTION AND DEFORMABLE OBJECTS, PROCEEDINGS, 2008, 5098 : 1 - +
  • [36] Sparse index tracking using sequential Monte Carlo
    Satpathy, Tanmay
    Shah, Rushabh
    QUANTITATIVE FINANCE, 2022, 22 (09) : 1579 - 1592
  • [37] Sequential Monte Carlo as approximate sampling: bounds, adaptive resampling via ∞-ESS, and an application to particle Gibbs
    Huggins, Jonathan H.
    Roy, Daniel M.
    BERNOULLI, 2019, 25 (01) : 584 - 622
  • [38] GFSK Demodulation Using Sequential Monte Carlo Technique
    Abdallah, Alhaj-Saleh
    Nsour, Ahmad
    Zohdy, Mohamed
    Li, Jia
    IEEE WIRELESS COMMUNICATIONS LETTERS, 2015, 4 (06) : 621 - 624
  • [39] Bayesian Geosteering Using Sequential Monte Carlo Methods
    Veettil, Dilshad R. Akkam
    Clark, Kit
    PETROPHYSICS, 2020, 61 (01): : 99 - 111
  • [40] Valuation of barrier options using sequential Monte Carlo
    Shevchenko, Pavel V.
    Del Moral, Pierre
    JOURNAL OF COMPUTATIONAL FINANCE, 2017, 20 (04) : 107 - 135