確率的環境における時相論理制約下の逐次制御合成
Incremental Control Synthesis in Probabilistic Environments with Temporal Logic Constraints
グラフ状環境で確率的エージェントと相互作用する決定論的プラントに対し、時相論理式の充足確率を最大化する制御を、検証を活用した逐次的手法で効率的に合成する。
著者: Alphan Ulusoy, Tichakorn Wongpiromsarn, Calin Belta
分類: cs.RO, cs.LO
原文アブストラクト
In this paper, we present a method for optimal control synthesis of a plant that interacts with a set of agents in a graph-like environment. The control specification is given as a temporal logic statement about some properties that hold at the vertices of the environment. The plant is assumed to be deterministic, while the agents are probabilistic Markov models. The goal is to control the plant such that the probability of satisfying a syntactically co-safe Linear Temporal Logic formula is maximized. We propose a computationally efficient incremental approach based on the fact that temporal logic verification is computationally cheaper than synthesis. We present a case-study where we compare our approach to the classical non-incremental approach in terms of computation time and memory usage.
