Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Extending identifiability results from isolated networks to embedded networks (2402.14144v1)

Published 21 Feb 2024 in eess.SY and cs.SY

Abstract: This paper deals with the design of Excitation and Measurement Patterns (EMPs) for the identification of dynamical networks, when the objective is to identify only a subnetwork embedded in a larger network. Recent results have shown how to construct EMPs that guarantee identifiability for a range of networks with specific graph topologies, such as trees, loops, or Directed Acyclic Graphs (DAGs). However, an EMP that is valid for the identification of a subnetwork taken in isolation may no longer be valid when that subnetwork is embedded in a larger network. Our main contribution is to exhibit conditions under which it does remain valid, and to propose ways to enhance such EMP when these conditions are not satisfied.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (12)
  1. P. M. J. Van den Hof, A. Dankers, P. S. C. Heuberger, and X. Bombois, “Identification of dynamic models in complex networks with prediction error methods—Basic methods for consistent module estimates,” Automatica, vol. 49, no. 10, pp. 2994–3006, Oct. 2013.
  2. A. S. Bazanella, M. Gevers, and J. M. Hendrickx, “Network identification with partial excitation and measurement,” in 2019 IEEE 58th Conference on Decision and Control (CDC), Dec. 2019, pp. 5500–5506.
  3. J. M. Hendrickx, M. Gevers, and A. S. Bazanella, “Identifiability of Dynamical Networks With Partial Node Measurements,” IEEE Transactions on Automatic Control, vol. 64, no. 6, pp. 2240–2253, Jun. 2019.
  4. E. Mapurunga and A. S. Bazanella, “Identifiability of Dynamic Networks from Structure,” IFAC-PapersOnLine, vol. 54, no. 7, pp. 55–60, Jan. 2021.
  5. E. Mapurunga, M. Gevers, and A. S. Bazanella, “Excitation and Measurement Patterns for the Identifiability of Directed Acyclic Graphs,” in 2022 IEEE 61st Conference on Decision and Control (CDC), Dec. 2022, pp. 1616–1621.
  6. ——, “Necessary and sufficient conditions for the identifiability of isolated loops,” IEEE Control Systems Letters, pp. 2276–2280, 2022.
  7. S. Shi, X. Cheng, and P. M. J. V. d. Hof, “Single module identifiability in linear dynamic networks with partial excitation and measurement,” IEEE Transactions on Automatic Control, vol. 68, no. 1, pp. 285–300, 2023.
  8. X. Cheng, S. Shi, I. Lestas, and P. M. V. d. Hof, “A necessary condition for network identifiability with partial excitation and measurement,” IEEE Transactions on Automatic Control, vol. 68, no. 11, pp. 6820–6827, 2023.
  9. A. Legat and J. M. Hendrickx, “Combinatorial Characterization for Global Identifiability of Separable Networks with Partial Excitation and Measurement,” in 2023 62nd IEEE Conference on Decision and Control (CDC), Dec. 2023, pp. 2471–2476.
  10. ——, “Path-Based Conditions for Local Network Identifiability,” in 2021 60th IEEE Conference on Decision and Control (CDC), Dec. 2021, pp. 3024–3029.
  11. E. Mapurunga, M. Gevers, and A. S. Bazanella, “Identifiability of dynamic networks: The essential rôle of dources and dinks,” IEEE Transactions on Automatic Control, vol. 69, no. 2, pp. 1303–1308, 2024.
  12. E. Mapurunga and A. S. Bazanella, “Optimal Allocation of Excitation and Measurement for Identification of Dynamic Networks,” IFAC-PapersOnLine, vol. 54, no. 7, pp. 43–48, Jan. 2021.

Summary

We haven't generated a summary for this paper yet.