Set-membership localization with probabilistic errors

Interval methods have been shown to be efficient, robust and reliable to solve difficult set-membership localization problems. However they are unsuitable in a probabilistic context, where the approximation of an unbounded probability density function by a set cannot be accepted. This paper proposes a new probabilistic approach which makes possible to use classical set-membership localization methods which are robust with respect to outliers. The approach is illustrated on two simutated examples.