User:Prashantserai

Monte Carlo localization is a very well known and popular technique for Localization of Mobile robots. The algorithm for the same Algorithm MCL is shown in figure below. It is well known that, in order that the algorithm to work well, the amount of uncertainty in the sensor model needs to be inflated, which may not be very satisfactory. There have been approaches proposed in literature to alleviate the above-mentioned problem like incorporating only a limited number of readings at a time, "Robust Monte Carlo localization for mobile robots", "Unscented Particle Filters", "Improved Likelihood Models for Probabilistic Localization based on Range Scans", "Adaptive Full Scan Model for Range Finders in Dynamic Environments", etc. which have their respective limitations.

It was felt that, apart from the discreteness in the sample representation of the particle filter, another reason that necessitates the inflation of the sensor noise is the linear proportionality of, the belief probability function represented by the particle filter to, the density of particles. For a non-inflated model, the dynamic range of probabilities of the plausible hypotheses can be quite significant, and thus the use of linearly proportional resampling creates a loss of particle diversity. Consequentially, a variation is proposed to the Monte Carlo localization technique described in Algorithm MCL2; wherein the weights $w_{t}^{[m]}$ are transformed by a sublinear function $myfunc$ for eg. cube-root, log, etc. The resampling is then carried out proportional to the transformed weights $v_{t}^{[m]}$. After resampling, along with the particle pose, the remaining weight of the particle i.e. ${\frac {w_{t}^{[m]}}{v_{t}^{[m]}}}$ is also retained.

It is expected that such a modification, will allow better accuracy than compared to use of inflated sensor model, as well as, allow one to retain the robustness that the use of inflated sensor model provides. The performance of the proposed Algorithm MCL2 remains to be evaluated though.

 Algorithm MCL$(X_{t-1},u_{t},z_{t})$:
       ${\bar {X_{t}}}=X_{t}=\emptyset$
       for $m=1$ to $M$:
           $x_{t}^{[m]}=$ motion_update$(u_{t},x_{t-1}^{[m]})$
           $w_{t}^{[m]}=$ sensor_update$(z_{t},x_{t}^{[m]})$
           ${\bar {X_{t}}}={\bar {X_{t}}}+\langle x_{t}^{[m]},w_{t}^{[m]}\rangle$
       endfor
       //weights w may be normalized here
       for $m=1$ to $M$:
           draw $x_{t}^{[m]}$ from ${\bar {X_{t}}}$ with probability $\propto w_{t}^{[m]}$
           $X_{t}=X_{t}+x_{t}^{[m]}$
       endfor
       return $X_{t}$

 Algorithm MCL2$(X_{t-1},u_{t},z_{t})$:
       ${\bar {X_{t}}}=X_{t}=\emptyset$
       for $m=1$ to $M$:
           $x_{t}^{[m]}=$ motion_update$(u_{t},x_{t-1}^{[m]})$
           $w_{t}^{[m]}=w_{t-1}^{[m]}\times$  sensor_update$(z_{t},x_{t}^{[m]})$
           $v_{t}^{[m]}=myfunc(w_{t}^{[m]})$
           ${\bar {X_{t}}}={\bar {X_{t}}}+\langle x_{t}^{[m]},w_{t}^{[m]},v_{t}^{[m]}\rangle$
       endfor
       //weights w and v may be normalized here
       for $m=1$ to $M$:
           draw $x_{t}^{[m]}$ from ${\bar {X_{t}}}$ with probability $\propto v_{t}^{[m]}$
           $w_{t}^{[m]}={\frac {w_{t}^{[m]}}{v_{t}^{[m]}}}$
           $X_{t}=X_{t}+\langle x_{t}^{[m]},w_{t}^{[m]}\rangle$
       endfor
       return $X_{t}$

$myfunc$ could be a sub-linear function like nth-root, log, etc.