.png){kind=icon}
返回
Underapproximating Backward Reachable Sets by Semialgebraic Sets
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2017.2694351.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Underapproximations (UAs) of backward reachable sets play an important role in controller synthesis and trajectory analysis for constrained nonlinear dynamical systems, but there are few methods available to compute them. Given a nonlinear system, a target region of simply connected compact type and a time duration, we present a method using boundary analysis to compute an UA of the backward reachable set. The UA is represented as a semialgebraic set, formed by what we term polynomial level - set functions. The polynomial level - set function is a semidefinite positive function with one real root, such that the interior and closure of a semialgebraic set formed by it are both simply connected and have the same boundary. The function can be computed by solving a convex program, which is constructed based on sum-of-squares decomposition and linear interval inequalities. We test our method on several examples and compare them with existing methods. The results show that our method can obtain better estimations more efficiently in terms of time for these special examples.
Keyword:
Boundary analysis
convex programming
semialgebraic sets
underapproximation (UA)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
.png){kind=icon}
分享收藏A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games连续动态游戏的可到达集的时间相关的hamilton-jacobi公式
OAAI
OAAI分享收藏分享收藏
查看更多内容