A graph-oriented approach to address generically flat outputs in structured LTI discrete-time systems
Fiche du document
7 avril 2022
- handle: 10670/1.xje279
- hal: hal-03617812
- doi: 10.1016/j.automatica.2022.110344
Ce document est lié à :
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.automatica.2022.110344
info:eu-repo/semantics/OpenAccess
Mots-clés
Structured linear systems Graph theory FlatnessSujets proches
Natural science Sciences Science of science Discrete event systems Sampled-data systems DES (System analysis)Citer ce document
Taha Boukhobza et al., « A graph-oriented approach to address generically flat outputs in structured LTI discrete-time systems », HAL-SHS : sciences de l'information, de la communication et des bibliothèques, ID : 10.1016/j.automatica.2022.110344
Métriques
Partage / Export
Résumé
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.