HMMフレームワークにおける適応的信念伝播を用いたオンライン目標位置推定
Online Target Localization using Adaptive Belief Propagation in the HMM Framework
HMM上で隠れ状態を粗から細へ段階的に絞り込む適応的ビタビ法を提案し、大規模空間でも計算コストを抑えてオンラインで目標軌跡を推定する。UWBセンサネットワーク実験で有効性を示した。
著者: Min-Won Seo, Solmaz S. Kia
分類: cs.RO
原文アブストラクト
This paper proposes a novel adaptive sample space-based Viterbi algorithm for target localization in an online manner. The method relies on discretizing the target's motion space into cells representing a finite number of hidden states. Then, the most probable trajectory of the tracked target is computed via dynamic programming in a Hidden Markov Model (HMM) framework. The proposed method uses a Bayesian estimation framework which is neither limited to Gaussian noise models nor requires a linearized target motion model or sensor measurement models. However, an HMM-based approach to localization can suffer from poor computational complexity in scenarios where the number of hidden states increases due to high-resolution modeling or target localization in a large space. To improve this poor computational complexity, this paper proposes a belief propagation in the most probable belief space with a low to high-resolution sequentially, reducing the required resources significantly. The proposed method is inspired by the k-d Tree algorithm (e.g., quadtree) commonly used in the computer vision field. Experimental tests using an ultra-wideband (UWB) sensor network demonstrate our results.
