A graph-oriented approach to address generically flat outputs in structured LTI discrete-time systems

This paper addresses difference flatness for structured LTI discrete-time systems. Two forms of necessary and sufficient conditions for an output to be a structural flat output are given. First, a preliminary result algebraically defines a flat output in terms of invariant zeros regardless whether a...

Full description

Saved in:
Bibliographic Details
Published inAutomatica (Oxford) Vol. 142; no. August; p. 110344
Main Authors Boukhobza, Taha, van der Woude, Jacob, Commault, Christian, Millérioux, Gilles
Format Journal Article
LanguageEnglish
Published Elsevier Ltd 01.08.2022
Elsevier
Subjects
Automatic
Engineering Sciences
Flatness
Graph theory
Structured linear systems
Graph theory
Structured linear systems
Flatness
Online AccessGet full text

Cover

More Information
Summary:This paper addresses difference flatness for structured LTI discrete-time systems. Two forms of necessary and sufficient conditions for an output to be a structural flat output are given. First, a preliminary result algebraically defines a flat output in terms of invariant zeros regardless whether an LTI system is structured or not. Next, the conditions are expressed in terms of graphical conditions to define a structural flat output. Checking for the graphical conditions calls for algorithms that have polynomial-time complexity and that are commonly used for digraphs. The tractability of the conditions is illustrated on several examples.
ISSN:0005-1098
1873-2836
DOI:10.1016/j.automatica.2022.110344