• DocumentCode
    66657
  • Title

    Polynomial Level-Set Method for Polynomial System Reachable Set Estimation

  • Author

    Ta-Chung Wang ; Lall, Sanjay ; West, Michael

  • Author_Institution
    Inst. of Civil Aviation, Nat. Cheng-Kung Univ., Tainan, Taiwan
  • Volume
    58
  • Issue
    10
  • fYear
    2013
  • fDate
    Oct. 2013
  • Firstpage
    2508
  • Lastpage
    2521
  • Abstract
    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
    polynomials; set theory; complex shapes; polynomial level set method; polynomial system reachable set estimation; semialgebraic set; semidefinite program; sublevel representation; Approximation algorithms; Approximation methods; Direction-of-arrival estimation; Estimation; Finite wordlength effects; Lyapunov methods; Polynomials; Algebraic/geometric methods; level-set methods; nonlinear systems; semi-definite programming;
  • fLanguage
    English
  • Journal_Title
    Automatic Control, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9286
  • Type

    jour

  • DOI
    10.1109/TAC.2013.2263916
  • Filename
    6517253