Polynomial level-set method for polynomial system reachable set estimation

Ta Chung Wang, Sanjay Lall, Matthew West

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish (US)
Article number6517253
Pages (from-to)2508-2521
Number of pages14
JournalIEEE Transactions on Automatic Control
Volume58
Issue number10
DOIs
StatePublished - 2013

Keywords

  • Algebraic/geometric methods
  • level-set methods
  • nonlinear systems
  • semi-definite programming

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Polynomial level-set method for polynomial system reachable set estimation'. Together they form a unique fingerprint.

Cite this