Recently, I have come across references to the Monte Carlo Kalman Filter (MCKF), which is a variant of the Sigma-Point Kalman Filter (SPKF). The key difference between the MCKF and the remainder of the SPKFs is that the sigma points are selected randomly rather than deterministically as is the case with the Unscented Kalman Filter and various other members of the family.
That is, for the SPKF, the propagated sigma points are selected via:
$ \mathbf{x}^{(i)}_k = \hat{\mathbf{x}}_k + w_k \mathbf{S}^{(i)}_k$
where $\mathbf{S}^{(i)}_k$ is the $i$-th column of the state covariance cholesky factor, $w_k$ is a weight (dependant on the specific SPKF algorithm) and $\hat{\mathbf{x}}_k$ is the mean.
The MCKF, on the other hand, has its sigma points drawn from:
$\mathbf{x}^{(i)}_k \sim N\left(\hat{\mathbf{x}}_k; \mathbf{P}_k\right)$
The number of sigma-points is user selectable.
Since the MCKF shares the Guassian assumption, the remainder of the algorithms are practially identical (see Wikipedia). So, it's sort of a halfway house between the SPKFs and Particle Filters.
So, my questions are:
- Has anyone seen the MCKF variant in practice (or academia)?
- Are there many papers around tracking its theoretical properties or application performance? Google Scholar is suprisingly unhelpful.
- When would one use the MCKF over the UKF/DDF/... ?
- (Of most interest) How many samples would one expect to need to be "performance equivalent" with the standard UKF (which has $2N_x$ sigma-points)? How does this scale with increasing $N_x$?