Dead beat controllability of polynomial systems: symbolic computation approaches (Q4396083)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1164555
Language Label Description Also known as
default for all languages
No label defined
    English
    Dead beat controllability of polynomial systems: symbolic computation approaches
    scientific article; zbMATH DE number 1164555

      Statements

      Dead beat controllability of polynomial systems: symbolic computation approaches (English)
      0 references
      0 references
      0 references
      23 August 1998
      0 references
      output dead-beat controllability
      0 references
      minimum time controllers
      0 references
      polynomial systems
      0 references
      symbolic computation program
      0 references
      Gröbner basis method
      0 references
      A class of polynomial systems \[ x(k+1) =f\bigl(x(k), u(k)\bigr) \quad y(k)= h\bigl(x(k) \bigr) \tag{1} \] is considered, where \(x(k)\), \(y(k)\) and \(u(k)\) are, respectively, state, output and input at time \(k\), and \(f\) and \(h\) are polynomials in all their arguments. State and output dead-beat (DB) controllability tests for (1) with rational coefficients are established which are based on the Quantifier Elimination by the Partial Cylindrical Algebraic Decomposition (QEPCAD) symbolic computation program. Families of minimum time state/output DB controllers are proposed. It is shown that for odd polynomial systems, the Gröbner basis method can be used together with QEPCAD to check the output DB controllability.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references