arrow
Return

Polynomial Level-Set Method for Polynomial System Reachable Set Estimation

delete2013-10-01
delete20
PRE
AI
T
Ta-Chung Wang *
S
Sanjay Lall
M
Matthew West
DOI:10.1109/TAC.2013.2263916delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In this paper, we present a polynomial level-set method for advecting a semi-algebraic set for polynomial systems. This method uses the sub-level representation of sets. The problem of flowing these sets under the advection map of a dynamical system is converted to a semi-definite program, which is then used to compute the coefficients of the polynomials. The method presented in this paper does not require either the sets being positively invariant or star-shaped. Hence, the proposed algorithm can describe the behavior of system states both inside and outside the domain of attraction and can also be used to describe more complex shapes of sets. We further address the related problems of constraining the degree of the polynomials. Various numerical examples are presented to show the effectiveness of advection approach.
Keywords:
Algebraic/geometric methods
level-set methods
nonlinear systems
semi-definite programming

Journal

IEEE Transactions on Automatic Control cover
IEEE Transactions on Automatic Control
IF:
7
Papers:
1.3W
Citations:
6.7W

Organization

N
National Cheng Kung University
Scholars:
2.6W
Papers: 2.3W
Citations: 1.7W
S
Stanford University
Scholars:
9.6W
Papers: 8.2W
Citations: 17.0W
University of Illinois System cover
University of Illinois System
Scholars:
6.8W
Papers: 6.2W
Citations: 644
researcher View more organizations