Multiple model tracking by imprecise markov trees

We present a new procedure for tracking manoeuvring objects by hidden Markov chains. It leads to more reliable modelling of the transitions between hidden states compared to similar approaches proposed within the Bayesian framework: we adopt convex sets of probability mass functions rather than single ‘precise probability’ specifications, in order to provide a more realistic and cautious model of the manoeuvre dynamics. In general, the downside of such increased freedom in the modelling phase is a higher inferential complexity. However, the simple topology of hidden Markov chains allows for efficient tracking of the object through a recently developed belief propagation algorithm. Furthermore, the imprecise specification of the transitions can produce so-called indecision, meaning that more than one model may be suggested by our method as a possible explanation of the target kinematics. In summary, our approach leads to a multiple-model estimator whose performance, investigated through extensive numerical tests, turns out to be more accurate and robust than that of Bayesian ones.

[1]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[2]  Thiagalingam Kirubarajan,et al.  Estimation with Applications to Tracking and Navigation , 2001 .

[3]  M. Athans,et al.  State Estimation for Discrete Systems with Switching Parameters , 1978, IEEE Transactions on Aerospace and Electronic Systems.

[4]  P. Walley Statistical Reasoning with Imprecise Probabilities , 1990 .

[5]  Andrew J. Viterbi,et al.  Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.

[6]  X. R. Li,et al.  Multiple-model estimation with variable structure. IV. Design and evaluation of model-group switching algorithm , 1999 .

[7]  Gert de Cooman,et al.  Epistemic irrelevance in credal nets: The case of imprecise Markov trees , 2010, Int. J. Approx. Reason..

[8]  Philippe Smets,et al.  Decision making in the TBM: the necessity of the pignistic transformation , 2005, Int. J. Approx. Reason..

[9]  Fabio Gagliardi Cozman,et al.  The Inferential Complexity of Bayesian and Credal Networks , 2005, IJCAI.

[10]  K. Ito,et al.  On State Estimation in Switching Environments , 1970 .

[11]  Marco Zaffalon,et al.  Reliable hidden Markov model filtering through coherent lower previsions , 2009, 2009 12th International Conference on Information Fusion.

[12]  Fabio Gagliardi Cozman,et al.  Credal networks , 2000, Artif. Intell..