Identifiability in Dynamic Acyclic Networks with Partial Excitations and Measurements
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2022
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866929303421190144 |
|---|---|
| author | Cheng, Xiaodong Shi, Shengling Lestas, Ioannis Hof, Paul M. J. Van den |
| author_facet | Cheng, Xiaodong Shi, Shengling Lestas, Ioannis Hof, Paul M. J. Van den |
| contents | This paper deals with dynamic networks in which the causality relations between the vertex signals are represented by linear time-invariant transfer functions (modules). Considering an acyclic network where only a subset of its vertices are measured and a subset of the vertices are excited, we explore conditions under which all the modules are identifiable on the basis of measurement data. Two sufficient conditions are presented in the paper, where the first condition concerns an identifiability analysis that needs to be performed for each vertex, while the second condition, based on the concept of tree/anti-tree covering, results from a graphical synthesis approach to allocate actuators and sensors in an acyclic network for achieving generic identifiability. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2201_07548 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Identifiability in Dynamic Acyclic Networks with Partial Excitations and Measurements Cheng, Xiaodong Shi, Shengling Lestas, Ioannis Hof, Paul M. J. Van den Optimization and Control This paper deals with dynamic networks in which the causality relations between the vertex signals are represented by linear time-invariant transfer functions (modules). Considering an acyclic network where only a subset of its vertices are measured and a subset of the vertices are excited, we explore conditions under which all the modules are identifiable on the basis of measurement data. Two sufficient conditions are presented in the paper, where the first condition concerns an identifiability analysis that needs to be performed for each vertex, while the second condition, based on the concept of tree/anti-tree covering, results from a graphical synthesis approach to allocate actuators and sensors in an acyclic network for achieving generic identifiability. |
| title | Identifiability in Dynamic Acyclic Networks with Partial Excitations and Measurements |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2201.07548 |