arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1907.07556eess.SYcs.SY
收藏

线性时序逻辑约束下的最优安全控制

Optimal Secure Control with Linear Temporal Logic Constraints

Luyao Niu, Andrew Clark

摘要:

在逻辑约束下的信息物理系统的自动控制综合的先前工作主要集中在环境干扰或建模的不确定性,然而,故意和恶意攻击的影响研究较少。在本文中,我们考虑了一个离散时间动力系统与线性时序逻辑(LTL)的约束下,存在一个对手,这是建模为一个随机博弈。我们假设对手在选择攻击策略之前观察控制策略。我们研究两个问题。在第一个问题中,我们合成了一个鲁棒控制政策的随机博弈,最大限度地满足LTL约束的概率。提出了一种基于数值迭代的算法来计算最优控制策略。在第二个问题中,我们专注于一个子类的LTL约束,其中包括一个任意的LTL公式和不变的约束。然后,我们研究了计算控制策略的问题,该控制策略可以最大限度地减少违反不变约束的预期数量,同时最大限度地提高满足任意LTL约束的概率。我们所期望的控制策略的最优性条件的特征。提出了一种基于策略迭代的控制策略计算算法。我们说明了所提出的方法,使用两个数值案例研究。

英文摘要:

Prior work on automatic control synthesis for cyber-physical systems under logical constraints has primarily focused on environmental disturbances or modeling uncertainties, however, the impact of deliberate and malicious attacks has been less studied. In this paper, we consider a discrete-time dynamical system with a linear temporal logic (LTL) constraint in the presence of an adversary, which is modeled as a stochastic game. We assume that the adversary observes the control policy before choosing an attack strategy. We investigate two problems. In the first problem, we synthesize a robust control policy for the stochastic game that maximizes the probability of satisfying the LTL constraint. A value iteration based algorithm is proposed to compute the optimal control policy. In the second problem, we focus on a subclass of LTL constraints, which consist of an arbitrary LTL formula and an invariant constraint. We then investigate the problem of computing a control policy that minimizes the expected number of invariant constraint violations while maximizing the probability of satisfying the arbitrary LTL constraint. We characterize the optimality condition for the desired control policy. A policy iteration based algorithm is proposed to compute the control policy. We illustrate the proposed approaches using two numerical case studies.

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

↑