On full controllability criteria of a descriptor system. The polynomial solution of a control problem with checkpoints

On full controllability criteria of a descriptor system. The polynomial solution of a control problem with checkpoints

0.00 Avg rating0 Votes
Article ID: iaor20111904
Volume: 72
Issue: 1
Start Page Number: 23
End Page Number: 37
Publication Date: Jan 2011
Journal: Automation and Remote Control
Authors:
Keywords: polynomial programs
Abstract:

We derive full controllability criteria for a stationary dynamical system described by an algebro‐differential relation with rectangular matrix coefficient. The derivation is done by multistage splitting of the spaces into subspaces in special and general cases. We construct a polynomial control and state of the descriptor system in case the system trajectory passes an arbitrary finite amount of checkpoints without projectors.

Reviews

Required fields are marked *. Your email address will not be published.