Multiple model tracking by imprecise markov trees

• Main Authors: Antonucci, A., Benavoli, A., Zaffalon, M., de Cooman, G., Hermans, F.
• Format: Conference Proceeding
• Language: English
• Subjects: Bayesian methods; Belief propagation; Filtering; hidden Markov chain; Hidden Markov models; imprecise Markov tree; imprecise probability; Inference algorithms; Kalman filtering; Kinematics; Robustness; Target tracking; Testing; Topology; tracking

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 dasiaprecise probabilitypsila 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.