返回
Exploiting Partial Observability for Optimal Deception
DOI:10.1109/TAC.2022.3209959.png)
摘要
En 中文
Deception is a useful tool in situations where an agent operates in the presence of its adversaries. We consider a setting where a supervisor provides a reference policy to an agent, expects the agent to operate in an environment by following the reference policy, and partially observes the agent's behavior. The agent instead follows a different deceptive policy to achieve a different task. We model the environment with a Markov decision process and study the synthesis of optimal deceptive policies under partial observability. We formalize the notion of deception as a hypothesis testing problem and show that the synthesis of optimal deceptive policies is nondeterministic polynomial-time hard (NP-hard). As an approximation, we consider the class of mixture policies, which provides a convex optimization formulation of the deception problem. We give an algorithm that converges to the optimal mixture policy. We also consider a special class of Markov decision processes where the transition and observation functions are deterministic. For this case, we give a randomized algorithm for path planning that generates a path for the agent in polynomial time and achieves the optimal value for the considered objective function.
Keyword:
Index Terms-Computational complexity
deception under par-tial observations
Markov decision processes (MDPs)
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
STRUCTURAL ANALYSIS OF THE dur LOCI IN S. CEREVISIAE: TWO DOMAINS OF A SINGLE MULTIFUNCTIONAL GENE
Genetics
IF0
Deep Learning Based Attack Detection for Cyber-Physical System Cybersecurity: A Survey基于深度学习的网络物理系统网络安全攻击检测综述
Superstitious seasonality in precious metals markets? Evidence from GARCH models with time-varying skewness and kurtosis贵金属市场的迷信季节性?具有时变偏度和峰度的GARCH模型的证据

