Local subspace identification of distributed homogeneous systems with general interconnection patterns

Chengpu Yu, M Verhaegen

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

3 Citations (Scopus)
25 Downloads (Pure)


This paper studies the local identification of large-scale homogeneous systems
with general network topologies. The considered local system identification problem involves unmeasurable signals between neighboring subsystems. Compared with our previous work in Yu et al. (2014) which solves the local identification of 1D homogeneous systems, the main challenge of this work is how to deal with the general network topology. To overcome this problem, we first decompose the interested local system into separate subsystems using some state, input and output transform, namely the spatially lifted local system has block diagonal system matrices.We subsequently estimate the Markov parameters of the local system by solving a nuclear norm regularized optimization problem. To realize the state-space system model from the estimated Markov parameters, another nuclear norm regularized optimization problem is provided by taking into account of the inherent dependence of a redundant parameter vector. Finally, the overall identification procedure is summarized.
Original languageEnglish
Title of host publicationIFAC-PapersOnline - 17th IFAC Symposium on System Identification
EditorsY Zhao, E-W Bai, J-F Zhang
Place of PublicationLaxenburg, Austria
Number of pages5
Publication statusPublished - 2015
EventSYSID 2015, Beijing, China - Laxenburg, Austria
Duration: 19 Oct 201521 Oct 2015

Publication series

ISSN (Print)2405-8963


ConferenceSYSID 2015, Beijing, China


  • Subspace identification
  • nuclear norm
  • networked systems

Fingerprint Dive into the research topics of 'Local subspace identification of distributed homogeneous systems with general interconnection patterns'. Together they form a unique fingerprint.

Cite this