随机系统的在线屏蔽
Online Shielding for Stochastic Systems
摘要:
在本文中,我们提出了一种方法来开发值得信赖的强化学习系统。为了确保安全,特别是在探索过程中,我们自动合成一个正确的建设运行时执行器,称为盾牌,阻止所有的动作是不安全的时间逻辑规范从代理。我们的主要贡献是一个新的综合算法计算屏蔽在线。现有的离线屏蔽方法预先详尽地计算所有状态-动作组合的安全性,导致巨大的离线计算时间、大的存储器消耗以及由于在巨大的数据库中查找而导致的运行时的显著延迟。在线屏蔽背后的直觉是在运行时计算在不久的将来可能达到的所有状态的集合。对于这些状态中的每一个,分析所有可用动作的安全性,并且一旦达到所考虑的状态之一就用于屏蔽。我们提出的方法是通用的,可以应用到广泛的规划问题的随机行为。对于我们的评估,我们选择了经典计算机游戏SNAKE的2人版本。游戏需要快速决策,多人游戏设置导致了一个大的状态空间,计算昂贵,无法进行详尽的分析。避碰的安全目标很容易转移到各种规划任务。
英文摘要:
In this paper, we propose a method to develop trustworthy reinforcement learning systems. To ensure safety especially during exploration, we automatically synthesize a correct-by-construction runtime enforcer, called a shield, that blocks all actions that are unsafe with respect to a temporal logic specification from the agent. Our main contribution is a new synthesis algorithm for computing the shield online. Existing offline shielding approaches compute exhaustively the safety of all states-action combinations ahead-of-time, resulting in huge offline computation times, large memory consumption, and significant delays at run-time due to the look-ups in a huge database. The intuition behind online shielding is to compute during run-time the set of all states that could be reached in the near future. For each of these states, the safety of all available actions is analysed and used for shielding as soon as one of the considered states is reached. Our proposed method is general and can be applied to a wide range of planning problems with stochastic behavior. For our evaluation, we selected a 2-player version of the classical computer game SNAKE. The game requires fast decisions and the multiplayer setting induces a large state space, computationally expensive to analyze exhaustively. The safety objective of collision avoidance is easily transferable to a variety of planning tasks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。