仮説駆動型信念MDPにおける複数動的モデルの不確かさの解消
Resolving Multiple-Dynamic Model Uncertainty in Hypothesis-Driven Belief-MDPs
複数の動的モデル仮説を持つ信念MDPを新たに定式化し、仮説の特定とPOMDPでの性能を両立する行動をスパース木探索で計画する手法を提案した。
著者: Ofer Dagan, Tyler Becker, Zachary N. Sunberg
分類: cs.AI, cs.RO
原文アブストラクト
When human operators of cyber-physical systems encounter surprising behavior, they often consider multiple hypotheses that might explain it. In some cases, taking information-gathering actions such as additional measurements or control inputs given to the system can help resolve uncertainty and determine the most accurate hypothesis. The task of optimizing these actions can be formulated as a belief-space Markov decision process that we call a hypothesis-driven belief MDP. Unfortunately, this problem suffers from the curse of history similar to a partially observable Markov decision process (POMDP). To plan in continuous domains, an agent needs to reason over countlessly many possible action-observation histories, each resulting in a different belief over the unknown state. The problem is exacerbated in the hypothesis-driven context because each action-observation pair spawns a different belief for each hypothesis, leading to additional branching. This paper considers the case in which each hypothesis corresponds to a different dynamic model in an underlying POMDP. We present a new belief MDP formulation that: (i) enables reasoning over multiple hypotheses, (ii) balances the goals of determining the (most likely) correct hypothesis and performing well in the underlying POMDP, and (iii) can be solved with sparse tree search.
