Decentralized minimax control problems with partial history sharing
Decentralized minimax control problems with partial history sharing
复制标题
具有部分历史共享的分散式极小极大控制问题
DOI：
--
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
A. Nayyar
中科院分区：
文献类型：
--
作者：
Mukul Gagrani;A. Nayyar
研究了具有部分历史共享信息结构的分散minimax控制问题。部分历史共享模型是一个一般的分散模型，其中（i）控制器通过共享内存顺序地彼此共享他们过去的数据（过去的观察和控制）的一部分;以及（ii）所有控制器都有共享数据（公共信息）的完美回忆。我们不是将动态和观测中的噪声变量建模为随机变量，而是将它们建模为在一些固定和已知的有限集中取值的不确定量。我们的目标是找到控制策略，最大限度地减少最坏情况下的成本。我们首先考虑一个终端成本问题。我们提供了一个共同的信息为基础的动态计划，这个分散的问题。动态规划中的信息状态是当前状态和与所有控制器公知的信息一致的局部信息的可行值的集合。然后，我们扩展终端成本问题，将添加剂的成本和共同的意见。
We consider a decentralized minimax control problem with the partial history sharing information structure. The partial history sharing model is a general decentralized model where (i) controllers sequentially share part of their past data (past observations and control) with each other by means of a shared memory; and (ii) all controllers have perfect recall of the shared data (common information). Instead of modeling the noise variables in dynamics and observations as random variables, we model them as uncertain quantities that take values in some fixed and known finite sets. The objective is to find control strategies that minimize the worst-case cost. We first consider a terminal cost problem. We provide a common information based dynamic program for this decentralized problem. The information state in the dynamic program is the set of feasible values of the current state and local information consistent with the information that is commonly known to all controllers. We then extend the terminal cost problem to incorporate additive costs and common observations.