.png){kind=icon}
.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Boundary analysis
convex programming
semialgebraic sets
underapproximation (UA)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
Organization
View more organizations