ASPIRe: 相互情報量近似を用いた情報に基づく軌道計画による目標探索・追跡
ASPIRe: An Informative Trajectory Planner with Mutual Information Approximation for Target Search and Tracking
限られた視野の雑然環境で移動目標を探索・追跡するため、シグマ点近似で相互情報量を効率的に評価し、適応的粒子フィルタ木で軌道を計画する手法を提案した。
著者: Kangjie Zhou, Pengying Wu, Yao Su, Han Gao, Ji Ma, Hangxin Liu, Chang Liu
分類: cs.RO
原文アブストラクト
This paper proposes an informative trajectory planning approach, namely, \textit{adaptive particle filter tree with sigma point-based mutual information reward approximation} (ASPIRe), for mobile target search and tracking (SAT) in cluttered environments with limited sensing field of view. We develop a novel sigma point-based approximation to accurately estimate mutual information (MI) for general, non-Gaussian distributions utilizing particle representation of the belief state, while simultaneously maintaining high computational efficiency. Building upon the MI approximation, we develop the Adaptive Particle Filter Tree (APFT) approach with MI as the reward, which features belief state tree nodes for informative trajectory planning in continuous state and measurement spaces. An adaptive criterion is proposed in APFT to adjust the planning horizon based on the expected information gain. Simulations and physical experiments demonstrate that ASPIRe achieves real-time computation and outperforms benchmark methods in terms of both search efficiency and estimation accuracy.
