可达性分析的树结构方法
A Tree Structure Approach to Reachability Analysis
摘要:
可达性分析是一个强大的工具,可以捕捉行为,从而验证自治系统的安全性。然而,通用的方法,如汉密尔顿-雅可比方法,遭受维数灾难。在本文中,我们减轻了这个问题的系统中的尺寸,我们提出了一个新的算法的基础上的树结构的方法与几何修剪。数值例子将包括与线性和非线性问题的标准有限差分法的比较
英文摘要:
Reachability analysis is a powerful tool when it comes to capturing the behaviour, thus verifying the safety, of autonomous systems. However, general-purpose methods, such as Hamilton-Jacobi approaches, suffer from the curse of dimensionality. In this paper, we mitigate this problem for systems of moderate dimension and we propose a new algorithm based on a tree structure approach with geometric pruning. The numerical examples will include a comparison with a standard finite-difference method for linear and nonlinear problems
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。