arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1401.5756math.OC
收藏

部分可观测离散时间随机混杂系统的可达性

Reachability for Partially Observable Discrete Time Stochastic Hybrid Systems

Kendra Lesser, Meeko Oishi

摘要:

当为任何系统设计最优控制器时,通常的情况是系统的真实状态对于控制器是未知的,例如由于噪声测量或部分可观测的状态。在控制器的设计中必须考虑不完全的状态信息,以保持其最优性。在执行可达性计算时也是如此。为了估计随机系统的状态在给定时间范围内到达或停留在某个感兴趣的集合内的概率,有必要找到一个控制器(或至少证明一个存在),该控制器以最大概率将系统驱动到该集合。然而,该控制器不能访问系统的真实状态。到目前为止,很少有工作已经做了随机可达性计算与部分可观测状态。所做的工作依赖于将可达性最优化问题转换为具有附加费用函数的问题,其理论结果是众所周知的。我们的方法是保持乘法费用结构时,推导出一个充分统计量,减少了问题的完美状态信息之一。我们的转换包括一个措施的变化,简化了分布的充分统计量的条件下,其先前的值。给出了求解等价完全信息问题的一个动态规划递推算法,证明了该递推算法是有效的,存在一个最优解,并得到与原问题相同的解.我们还表明,我们的结果是等价的重新制定的附加成本问题,所以这样的重新制定是不需要的。

英文摘要:

When designing optimal controllers for any system, it is often the case that the true state of the system is unknown to the controller, for example due to noisy measurements or partially observable states. Incomplete state information must be taken into account in the controller's design in order to preserve its optimality. The same is true when performing reachability calculations. To estimate the probability that the state of a stochastic system reaches, or stays within, some set of interest in a given time horizon, it is necessary to find a controller (or at least prove one exists) that drives the system to that set with maximum probability. This controller, however, does not have access to the true state of the system. To date, little work has been done on stochastic reachability calculations with partially observable states. What work has been done relies on converting the reachability optimization problem to one with an additive cost function, for which theoretical results are well known. Our approach is to preserve the multiplicative cost structure when deriving a sufficient statistic that reduces the problem to one of perfect state information. Our transformation includes a change of measure that simplifies the distribution of the sufficient statistic conditioned on its previous value. We develop a dynamic programming recursion for the solution of the equivalent perfect information problem, proving that the recursion is valid, an optimal solution exists, and results in the same solution as to the original problem. We also show that our results are equivalent to those for the reformulated additive cost problem, and so such a reformulation is not required.

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

↑