Dead beat controllability of polynomial systems: symbolic computation approaches

DOI10.1109/9.661065zbMath0907.93038OpenAlexW2114681281MaRDI QIDQ4396083

Mareels, Iven M. Y., Dragan Nešić

Publication date: 23 August 1998

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/5f9da41d8e6dce3b2ecd271699e11c4146a39027

zbMATH Keywords

polynomial systemsGröbner basis methodsymbolic computation programminimum time controllersoutput dead-beat controllability

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Controllability (93B05) Nonlinear systems in control theory (93C10) Discrete-time control/observation systems (93C55)

Related Items (12)

On the solvability of polynomial systems arising in control ⋮ State deadbeat control of nonlinear systems: construction via sets ⋮ Boolean network representation of a continuous-time system and finite-horizon optimal control: application to the single-gene regulatory system for the lac operon ⋮ Controllability to the origin implies state-feedback stabilizability for discrete-time nonlinear systems ⋮ Application of algebraic geometry techniques in permanent-magnet DC motor fault detection and identification ⋮ On the finiteness of accessibility test for nonlinear discrete-time systems ⋮ Constructive nonlinear control: a historical perspective ⋮ Nonlinear minimum-time control with pre- and post-actuation ⋮ Commutative algebraic methods for controllability of discrete-time polynomial systems ⋮ Sinusoidal disturbance rejection in chaotic planar oscillators ⋮ Controllability and observability of Boolean networks arising from biology ⋮ Stabilisability and stability for explicit and implicit polynomial systems: A symbolic computation approach

Uses Software

• QEPCAD

This page was built for publication: Dead beat controllability of polynomial systems: symbolic computation approaches