TY - JOUR
T1 - Identification of affinely parameterized state–space models with unknown inputs
AU - Yu, Chengpu
AU - Chen, Jie
AU - Li, Shukai
AU - Verhaegen, Michel
N1 - Accepted Author Manuscript
PY - 2020
Y1 - 2020
N2 - The identification of affinely parameterized state–space system models is quite popular to model practical physical systems or networked systems, and the traditional identification methods require the measurements of both the input and output data. However, in the presence of partial unknown input, the corresponding system identification problem turns out to be challenging and sometimes unidentifiable. This paper provides the identifiability conditions in terms of the structural properties of the state–space model and presents an identification method which successively estimates the system states and the affinely parameterized system matrices. The estimation of the system matrices boils down to solving a bilinear optimization problem, which is reformulated as a difference-of-convex (DC) optimization problem and handled by the sequential convex programming method. The effectiveness of the proposed identification method is demonstrated numerically by comparing with the Gauss–Newton method and the sequential quadratic programming method.
AB - The identification of affinely parameterized state–space system models is quite popular to model practical physical systems or networked systems, and the traditional identification methods require the measurements of both the input and output data. However, in the presence of partial unknown input, the corresponding system identification problem turns out to be challenging and sometimes unidentifiable. This paper provides the identifiability conditions in terms of the structural properties of the state–space model and presents an identification method which successively estimates the system states and the affinely parameterized system matrices. The estimation of the system matrices boils down to solving a bilinear optimization problem, which is reformulated as a difference-of-convex (DC) optimization problem and handled by the sequential convex programming method. The effectiveness of the proposed identification method is demonstrated numerically by comparing with the Gauss–Newton method and the sequential quadratic programming method.
KW - Affinely parameterized state–space model
KW - Subspace identification
KW - Unknown system input
UR - http://www.scopus.com/inward/record.url?scp=85091634786&partnerID=8YFLogxK
U2 - 10.1016/j.automatica.2020.109271
DO - 10.1016/j.automatica.2020.109271
M3 - Article
AN - SCOPUS:85091634786
VL - 122
JO - Automatica
JF - Automatica
SN - 0005-1098
M1 - 109271
ER -