随机博弈中预见无意识对手
Anticipating Oblivious Opponents in Stochastic Games
AI总结:
本文提出一种在并发随机博弈中预见无意识环境策略以最大化奖励的方法,通过合成信息状态机跟踪信念状态,并在基准测试中验证其有效性。
摘要:
我们提出了一种系统性的方法,用于在并发随机博弈中预见“无意识”环境所采取的行动和策略,同时最大化奖励函数。我们的主要贡献在于合成一个有限的信息状态机,其字母表覆盖环境的各种行动。该自动机的每个状态都映射到关于环境所用策略的信念状态。我们引入了一致性概念,保证自动机跟踪的信念状态与通过完整历史知识获得的精确信念状态保持固定距离。我们提供了检查自动机一致性的方法,以及一种合成方法,该方法在成功终止时产生这样的机器。我们展示了信息状态机如何产生一个MDP,该MDP作为计算在博弈上定义的奖励函数最大化最优策略的起点。我们在基准示例上进行了实验评估,包括白内障手术和家具组装等任务的人类活动数据,其中我们的方法成功预见环境的策略和行动以最大化奖励。
英文摘要:
We present an approach for systematically anticipating the actions and policies employed by \emph{oblivious} environments in concurrent stochastic games, while maximizing a reward function. Our main contribution lies in the synthesis of a finite \emph{information state machine} whose alphabet ranges over the actions of the environment. Each state of the automaton is mapped to a belief state about the policy used by the environment. We introduce a notion of consistency that guarantees that the belief states tracked by our automaton stays within a fixed distance of the precise belief state obtained by knowledge of the full history. We provide methods for checking consistency of an automaton and a synthesis approach which upon successful termination yields such a machine. We show how the information state machine yields an MDP that serves as the starting point for computing optimal policies for maximizing a reward function defined over plays. We present an experimental evaluation over benchmark examples including human activity data for tasks such as cataract surgery and furniture assembly, wherein our approach successfully anticipates the policies and actions of the environment in order to maximize the reward.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。