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

Taha Boukhobza, Jacob van der Woude, Christian Commault, Gilles Millérioux*

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

Abstract

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.

Original languageEnglish
Article number110344
Number of pages8
JournalAutomatica
Volume142
DOIs
Publication statusPublished - 2022

Bibliographical note

Accepted author manuscript

Keywords

  • Flatness
  • Graph theory
  • Structured linear systems

Fingerprint

Dive into the research topics of 'A graph-oriented approach to address generically flat outputs in structured LTI discrete-time systems'. Together they form a unique fingerprint.

Cite this