With the recent surge of interest in using robotics and automation for civil purposes, providing safety and performance guarantees has become extremely important. In the past, differential games have been successfully used for the analysis of safety-critical systems. In particular, the Hamilton-Jacobi (HJ) formulation of differential games provides a flexible way to compute the reachable set, which can characterize the set of states which lead to either desirable or undesirable configurations, depending on the application. While HJ reachability is applicable to many small practical systems, the curse of dimensionality prevents the direct application of HJ reachability to many larger systems. To address computation complexity issues, various efficient computation methods in the literature have been developed for approximating or exactly computing the solution to HJ partial differential equations, but only when the system dynamics are of specific forms. In this paper, we propose a flexible method to trade off optimality with computation complexity in HJ reachability analysis. To achieve this, we propose to simplify system dynamics by treating state variables as disturbances. We prove that the resulting approximation is conservative in the desired direction, and demonstrate our method using a four-dimensional plane model.
Guaranteed-Safe Approximate Reachability via State Dependency-Based Decomposition
Hamilton Jacobi(HJ)可达性是一种广泛应用于机器人安全性分析的形式化验证工具。给定一个不安全状态的目标集,如果动力系统避开后向可达管(BRT),则保证该系统在最坏情况下不进入目标。然而,计算BRT遭受相对于状态维度的指数计算时间和空间复杂度。以前,系统分解和投影技术已被调查,但适用于更广泛的一类动态和保守程度之间的权衡一直具有挑战性。本文提出了一种状态依赖图来表示系统的动态特性,并对整个系统进行了分解,其中每个子系统中只包含依赖状态,“缺失”状态被视为有界扰动。因此,对于机器人技术中的各种动态,BRT可以快速地近似于低维链式子系统,并保持其安全性。我们证明了我们的方法与数值实验的4D四重积分器,和6D自行车,一个重要的汽车模型,以前是棘手的。