TY - JOUR
T1 - Parsimonious system identification from fragmented quantised measurements
AU - Sleem, Omar M.
AU - Lagoa, Constantino M.
N1 - Publisher Copyright:
© 2023 Informa UK Limited, trading as Taylor & Francis Group.
PY - 2024
Y1 - 2024
N2 - Quantisation is the process of mapping an input signal from an infinite continuous set to a countable set with a finite number of elements. It is a non-linear irreversible process, which makes the traditional methods of system identification no longer applicable. In this work, we propose a method for parsimonious linear time invariant system identification when only quantised observations, discerned from noisy data, are available. More formally, given a priori information on the system, represented by a compact set containing the poles of the system, and quantised realizations, our algorithm aims at identifying the least order system that is compatible with the available information. The proposed approach takes also into account that the available data can be subject to fragmentation. Our proposed algorithm relies on an ADMM approach to solve a (Formula presented.) quasi-norm objective problem. Numerical results highlight the performance of the proposed approach when compared to the (Formula presented.) minimisation in terms of the sparsity of the induced solution.
AB - Quantisation is the process of mapping an input signal from an infinite continuous set to a countable set with a finite number of elements. It is a non-linear irreversible process, which makes the traditional methods of system identification no longer applicable. In this work, we propose a method for parsimonious linear time invariant system identification when only quantised observations, discerned from noisy data, are available. More formally, given a priori information on the system, represented by a compact set containing the poles of the system, and quantised realizations, our algorithm aims at identifying the least order system that is compatible with the available information. The proposed approach takes also into account that the available data can be subject to fragmentation. Our proposed algorithm relies on an ADMM approach to solve a (Formula presented.) quasi-norm objective problem. Numerical results highlight the performance of the proposed approach when compared to the (Formula presented.) minimisation in terms of the sparsity of the induced solution.
UR - http://www.scopus.com/inward/record.url?scp=85164495747&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85164495747&partnerID=8YFLogxK
U2 - 10.1080/00207179.2023.2228943
DO - 10.1080/00207179.2023.2228943
M3 - Article
C2 - 39310798
AN - SCOPUS:85164495747
SN - 0020-7179
VL - 97
SP - 1770
EP - 1779
JO - International Journal of Control
JF - International Journal of Control
IS - 8
ER -