Closed-Loop Identification of Periodically Time-Varying Systems via Cyclic Reformulation

Abstract

This paper studies closed-loop identification of linear periodically time-varying (LPTV) plants, with emphasis on open-loop unstable plants for which open-loop experiments are not practically available. The central contribution is an exact algebraic plant-extraction theorem for cycled closed-loop realizations: for square strictly proper plants and a controller path satisfying an invertibility condition, the cycled plant transfer matrix is recovered from a shared state-space realization of the stable closed-loop maps from the external reference to the plant output and to the control input, without state augmentation, and without requiring the recovered plant realization to be stable. Thus, the stability requirement for data generation is shifted from the open-loop plant to the internally stable closed-loop system. Building on this result, a closed-loop identification algorithm is constructed that takes the reference, output, and input signals as data, applies standard subspace identification to the cycled signals, performs the algebraic plant extraction, and recovers the LPTV plant state-space parameters via a coordinate transformation; the conditioning of the inverse controller path governs the reliability of the extraction step. Numerical examples demonstrate the recovery of stable and open-loop unstable SISO LPTV plants and validate a MIMO case through coordinate-invariant Markov-parameter comparisons.