Quantitative Supervisory Control Game for Discrete Event Systems
Quantitative Supervisory Control Game for Discrete Event Systems
复制标题
DOI：
10.1109/tac.2015.2513901
复制
发表时间：
2016-10
影响因子：
6.8
通讯作者：
Sasinee Pruekprasert;T. Ushio;Takafumi Kanazawa
中科院分区：
文献类型：
--
作者：
Sasinee Pruekprasert;T. Ushio;Takafumi Kanazawa
我们制定了一个最优监督控制问题的定量非终止离散事件系统（DES）建模的有限加权自动机。监督器的控制性能由监督DES产生的无穷序列的最坏情况极限平均权重来评估。最佳监督器是避免死锁并最大化控制性能的监督器。我们提出了一个游戏理论的设计方法，使用两个玩家回合制的平均支付游戏自动机的最佳管理员。作为第一个球员，监督的目标是最大限度地提高最坏情况下的极限平均权重的生成序列;作为第二个球员，DES的目的是尽量减少它。我们表明，一个最佳的监督，可以计算从一个最佳的策略（第一个球员）这个游戏。然后，我们提出了一个算法来计算一个f-最小限制的最优监督，这是一个有限的内存最优监督，使尽可能多的序列，可以表示为一个有限版本的两个玩家游戏的最优策略。
We formulate an optimal supervisory control problem for quantitative non-terminating discrete event systems (DESs) modeled by finite weighted automata. The control performance of a supervisor is evaluated by the worst-case limit-average weight of the infinite sequences generated by the supervised DES. An optimal supervisor is a supervisor that avoids deadlocks and maximizes the control performance. We propose a game theoretical design method for an optimal supervisor using a two-player turn-based mean-payoff game automaton. As the first player, the objective of the supervisor is to maximize the worst-case limit-average weight of the generated sequences; as the second player, the DES aims to minimize it. We show that an optimal supervisor can be computed from an optimal strategy (of the first player) for this game. Then, we propose an algorithm to compute an f-minimally restrictive optimal supervisor, which is a finite-memory optimal supervisor that enables as many sequences as possible and can be represented by an optimal strategy for a finite version of the two-player game.