arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1603.05205math.OC
收藏

基于状态解耦扰动的快速可达集逼近

Fast Reachable Set Approximations via State Decoupling Disturbances

Mo Chen, Sylvia Herbert, Claire J. Tomlin

摘要:

随着最近对民用机器人和自动化的兴趣激增,提供安全和性能保证变得极其重要。在过去,微分对策已成功地用于安全关键系统的分析。特别是,微分对策的Hamilton Jacobi(HJ)公式提供了一种灵活的方法来计算可达集,它可以表征导致理想或不理想的配置的状态集,这取决于应用。虽然HJ可达性适用于许多小型实际系统,但维数灾难阻止HJ可达性直接应用于许多大型系统。为了解决计算复杂性问题,文献中已经开发了各种有效的计算方法来近似或精确计算HJ偏微分方程的解,但仅当系统动力学具有特定形式时。在本文中,我们提出了一个灵活的方法来权衡最优性与计算复杂性的HJ可达性分析。为了实现这一点,我们建议简化系统动力学处理状态变量的干扰。我们证明了所得近似在所需方向上是保守的,并使用四维平面模型演示了我们的方法。

英文摘要:

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.

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

↑