Allocation of excitation signals for generic identifiability of dynamic networks

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

5 Citations (Scopus)
3 Downloads (Pure)


This paper studies generic identifiability of dynamic networks, in which the edges connecting the vertex signals are described by proper transfer functions, and partial vertices are excited by designed external signals. We assume that the topology of the underlying graph is known, and all the vertex signals are measured. We show that generic identifiability of a directed network is related to the existence of a set of disjoint directed pseudo-trees that cover all the edges of the underlying graph, based on which, an excitation allocation problem is studied, aiming to select the minimal number excitation signals to achieve the generic identifiability of the whole network. An algorithmic procedure thereby is devised for selecting locations of the external signals such that all the edges can be consistently estimated.

Original languageEnglish
Title of host publication2019 IEEE 58th Conference on Decision and Control, CDC 2019
Place of PublicationPiscataway
PublisherInstitute of Electrical and Electronics Engineers
Number of pages6
ISBN (Electronic)9781728113982
Publication statusPublished - Dec 2019
Event58th IEEE Conference on Decision and Control (CDC 2019) - Nice, France
Duration: 11 Dec 201913 Dec 2019


Conference58th IEEE Conference on Decision and Control (CDC 2019)
Abbreviated titleCDC 2019
Internet address


Dive into the research topics of 'Allocation of excitation signals for generic identifiability of dynamic networks'. Together they form a unique fingerprint.

Cite this