Multiparticle Kalman filter for object localization in symmetric environments

• URL: http://arxiv.org/abs/2303.07897v1
• Date: Tue, 14 Mar 2023 13:31:43 GMT
• Title: Multiparticle Kalman filter for object localization in symmetric environments
• Authors: Roman Korkin and Ivan Oseledets and Aleksandr Katrutsa
• Abstract summary: Two well-known classes of filtering algorithms to solve the localization problem are Kalman filter-based methods and particle filter-based methods. We consider these classes, demonstrate their complementary properties, and propose a novel filtering algorithm that takes the best from two classes.
• Score: 69.81996031777717
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: This study considers the object localization problem and proposes a novel multiparticle Kalman filter to solve it in complex and symmetric environments. Two well-known classes of filtering algorithms to solve the localization problem are Kalman filter-based methods and particle filter-based methods. We consider these classes, demonstrate their complementary properties, and propose a novel filtering algorithm that takes the best from two classes. We evaluate the multiparticle Kalman filter in symmetric and noisy environments. Such environments are especially challenging for both classes of classical methods. We compare the proposed approach with the particle filter since only this method is feasible if the initial state is unknown. In the considered challenging environments, our method outperforms the particle filter in terms of both localization error and runtime.

Related papers

• Inverse Particle Filter [16.975704972827305]
  In cognitive systems, recent emphasis has been placed on studying the cognitive processes of the subject whose behavior was the primary focus of the system's cognitive response. This paper adopts a global filtering approach and presents the development of an inverse particle filter (I-PF) The particle filter framework employs Monte Carlo (MC) methods to approximate arbitrary posterior distributions.
  arXiv  Detail & Related papers  (2024-07-23T16:32:38Z)
• Implicit Maximum a Posteriori Filtering via Adaptive Optimization [4.767884267554628]
  We frame the standard Bayesian filtering problem as optimization over a time-varying objective. We show that our framework results in filters that are effective, robust, and scalable to high-dimensional systems.
  arXiv  Detail & Related papers  (2023-11-17T15:30:44Z)
• The Rank-Reduced Kalman Filter: Approximate Dynamical-Low-Rank Filtering In High Dimensions [32.30527731746912]
  We propose a novel approximate filtering and smoothing method which propagates lowrank approximations of low-rank matrices. Our method reduces computational complexity from cubic (for the Kalman filter) to emphquadratic in the state-space size in the worst-case.
  arXiv  Detail & Related papers  (2023-06-13T13:50:31Z)
• Computational Doob's h-transforms for Online Filtering of Discretely Observed Diffusions [65.74069050283998]
  We propose a computational framework to approximate Doob's $h$-transforms. The proposed approach can be orders of magnitude more efficient than state-of-the-art particle filters.
  arXiv  Detail & Related papers  (2022-06-07T15:03:05Z)
• An energy-based deep splitting method for the nonlinear filtering problem [0.0]
  The main goal of this paper is to approximately solve the nonlinear filtering problem through deep learning. This is achieved by solving the Zakai equation by a deep splitting method, previously developed for approximate solution of (stochastic) partial differential equations. This is combined with an energy-based model for the approximation of functions by a deep neural network.
  arXiv  Detail & Related papers  (2022-03-31T16:26:54Z)
• Deep Learning for the Benes Filter [91.3755431537592]
  We present a new numerical method based on the mesh-free neural network representation of the density of the solution of the Benes model. We discuss the role of nonlinearity in the filtering model equations for the choice of the domain of the neural network.
  arXiv  Detail & Related papers  (2022-03-09T14:08:38Z)
• Fourier Series Expansion Based Filter Parametrization for Equivariant Convolutions [73.33133942934018]
  2D filter parametrization technique plays an important role when designing equivariant convolutions. New equivariant convolution method based on the proposed filter parametrization method, named F-Conv. F-Conv evidently outperforms previous filter parametrization based method in image super-resolution task.
  arXiv  Detail & Related papers  (2021-07-30T10:01:52Z)
• Neural Kalman Filtering [62.997667081978825]
  We show that a gradient-descent approximation to the Kalman filter requires only local computations with variance weighted prediction errors. We also show that it is possible under the same scheme to adaptively learn the dynamics model with a learning rule that corresponds directly to Hebbian plasticity.
  arXiv  Detail & Related papers  (2021-02-19T16:43:15Z)
• When is Particle Filtering Efficient for Planning in Partially Observed Linear Dynamical Systems? [60.703816720093016]
  This paper initiates a study on the efficiency of particle filtering for sequential planning. We are able to bound the number of particles needed so that the long-run reward of the policy based on particle filtering is close to that based on exact inference. We believe this technique can be useful in other sequential decision-making problems.
  arXiv  Detail & Related papers  (2020-06-10T17:43:43Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.