arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.04768eess.SYcs.SY
收藏

基于部分可观测马尔可夫决策过程的约束主动分类

Constrained Active Classification Using Partially Observable Markov Decision Processes

Bo Wu, Niklas Lauffer, Mohamadreza Ahmadi, Suda Bharadwaj, Zhe Xu, Ufuk Topcu

摘要:

在这项工作中,我们研究的问题,积极分类的动力系统的属性,其特征在于作为一个有限集的马尔可夫决策过程(MDP)模型。我们感兴趣的是找到积极与动力系统相互作用的策略,并观察其反应,以便以高置信度有效地对感兴趣的属性进行分类。我们提出了一个基于部分可观测马尔可夫决策过程(POMDPs)的决策理论框架。所提出的框架依赖于分配一个分类信念(概率分布)的属性感兴趣。给定一个初始的信念,一个置信水平,可以作出分类决策,成本约束,安全的信念集,和一个有限的时间范围内,我们计算POMDP战略导致分类决策。我们提出了三种不同的算法来计算这样的策略。第一种算法通过数值迭代精确计算最优策略。为了克服计算精确解的计算复杂性,我们提出了第二种算法的基础上自适应采样和第三个基于蒙特卡洛树搜索近似的最佳概率达到分类决策。我们举例说明所提出的方法,从医疗诊断,安全监测和野生动物分类。

英文摘要:

In this work, we study the problem of actively classifying the attributes of dynamical systems characterized as a finite set of Markov decision process (MDP) models. We are interested in finding strategies that actively interact with the dynamical system and observe its reactions so that the attribute of interest is classified efficiently with high confidence. We present a decision-theoretic framework based on partially observable Markov decision processes (POMDPs). The proposed framework relies on assigning a classification belief (a probability distribution) to the attributes of interest. Given an initial belief, a confidence level over which a classification decision can be made, a cost bound, safe belief sets, and a finite time horizon, we compute POMDP strategies leading to classification decisions. We present three different algorithms to compute such strategies. The first algorithm computes the optimal strategy exactly by value iteration. To overcome the computational complexity of computing the exact solutions, we propose a second algorithm based on adaptive sampling and a third based on a Monte Carlo tree search to approximate the optimal probability of reaching a classification decision. We illustrate the proposed methodology using examples from medical diagnosis, security surveillance, and wildlife classification.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑