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

闭眼安全核:可观察性丧失情况下自治系统的安全

Eyes-Closed Safety Kernels: Safety for Autonomous Systems Under Loss of Observability

Forrest Laine, Chiu-Yuan Chiu, Claire Tomlin

摘要:

提出了一种以可证明安全的方式处理动力系统可观测性潜在损失的框架。受自动驾驶汽车使用的数据驱动感知系统的脆弱性的启发,我们制定了当传感模态失败或在自动操作过程中被发现不可信时出现的问题。我们把这个问题看作是被控制的动力系统和外部系统因素之间的微分博弈,因为外部系统因素会导致观测结果丢失。这个博弈是一个零和Stackelberg博弈,其中受控系统(领导者)试图找到一个最大化代表系统安全的函数的轨迹,而未观察到的因素(跟随者)试图最小化相同的函数。受控系统在这个博弈中获胜的初始配置集合代表了所有状态的集合,在这些状态中,即使外部因素失去了可观测性,也可以保持安全性。这就是我们称之为闭眼安全内核的集合。在实际应用中,由受控系统的获胜策略定义的策略仅需要在外部系统的可观测性丧失或系统由于其他非安全导向的控制方案而偏离闭眼安全核时执行。我们提出了一种离线解决这个游戏的方法,这样所得到的获胜策略可以用于计算效率高,可证明安全,在线控制时需要的。提出的解决方案的基础上表示的游戏使用两个汉密尔顿-雅可比偏微分方程的解决方案。我们通过一个现实的例子来说明我们的框架的适用性,在这个例子中,自动驾驶汽车必须避免动态障碍物,尽管可能会失去可观测性。

英文摘要:

A framework is presented for handling a potential loss of observability of a dynamical system in a provably-safe way. Inspired by the fragility of data-driven perception systems used by autonomous vehicles, we formulate the problem that arises when a sensing modality fails or is found to be untrustworthy during autonomous operation. We cast this problem as a differential game played between the dynamical system being controlled and the external system factor(s) for which observations are lost. The game is a zero-sum Stackelberg game in which the controlled system (leader) is trying to find a trajectory which maximizes a function representing the safety of the system, and the unobserved factor (follower) is trying to minimize the same function. The set of winning initial configurations of this game for the controlled system represent the set of all states in which safety can be maintained with respect to the external factor, even if observability of that factor is lost. This is the set we refer to as the Eyes-Closed Safety Kernel. In practical use, the policy defined by the winning strategy of the controlled system is only needed to be executed whenever observability of the external system is lost or the system deviates from the Eyes-Closed Safety Kernel due to other, non-safety oriented control schemes. We present a means for solving this game offline, such that the resulting winning strategy can be used for computationally efficient, provably-safe, online control when needed. The solution approach presented is based on representing the game using the solutions of two Hamilton-Jacobi partial differential equations. We illustrate the applicability of our framework by working through a realistic example in which an autonomous car must avoid a dynamic obstacle despite potentially losing observability.

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

↑