Monte Carlo Filtering on Lie Groups
نویسندگان
چکیده
We propose a nonlinear lter for estimating the trajectory of a random walk on a matrix Lie group with constant computational complexity. It is based on a nite-dimensional approximation of the conditional distribution of the state given past measurements via a set of fair samples, which are updated at each step and proven to be consistent with the updated conditional distribution. The algorithm proposed, like other Monte Carlo methods, can in principle track arbitrary distributions evolving on arbitrarily large state spaces. However, several issues concerning sample impoverishment need to be taken into account when designing practical working systems.
منابع مشابه
Brownian Processes for Monte Carlo Integration on Compact Lie Groups
This paper proposes a Monte Carlo approach for the evaluation of integrals of smooth functions defined on compact Lie groups. The approach is based on the ergodic property of Brownian processes in compact Lie groups. The paper provides an elementary proof of this property and obtains the following results. It gives the rate of almost sure convergence of time averages along with a “large deviati...
متن کاملPopulation Based Particle Filtering
This paper proposes a novel particle filtering strategy by combining population Monte Carlo Markov chain methods with sequential Monte Carlo chain particle which we call evolving population Monte Carlo Markov Chain (EP MCMC) filtering. Iterative convergence on groups of particles (populations) is obtained using a specified kernel moving particles toward more likely regions. The proposed techniq...
متن کاملDeterministic Attitude and Pose Filtering, an Embedded Lie Groups Approach
Attitude estimation is a core problem in many robotic systems that perform automated or semi automated navigation. The configuration space of the attitude motion is naturally modelled on the Lie group of special orthogonal matrices SO(3). Many current attitude estimation methods are based on non-matrix parameterization of attitude. Non-matrix parameterization schemes sometimes lead to modelling...
متن کاملA bayesian model for collaborative filtering
Consider the general setup where a set of items have been partially rated by a set of judges, in the sense that not every item has been rated by every judge. For this setup, we propose a Bayesian approach for the problem of predicting the missing ratings from the observed ratings. This approach incorporates similarity by assuming the set of judges can be partitioned into groups which share the ...
متن کاملRecognising simplicity of black-box groups
We investigate the complexity of computing involutions and their centralizers in groups of Lie type over finite fields of odd order, and discuss applications to the problem of deciding whether a matrix group, or a black-box group of known characteristic, is simple. We show that if the characteristic is odd, then simplicity can be recognised in Monte Carlo polynomial time. Mathematics Subject Cl...
متن کامل