TY - JOUR
T1 - Optimal Nonparametric Identification from Arbitrary Corrupt Finite Time Series
AU - Chen, Jie
AU - Nett, Carl N.
AU - Fan, Michael K.H.
PY - 1995/4
Y1 - 1995/4
N2 - In this paper we formulate and solve a worst-case sys- tem identification problem for single-input, single-output, linear, shift-invariant, distributed parameter plants. The available a priori information in this problem consists of time-dependent upper and lower bounds on the plant impulse response and the additive output noise. The available a posteriori information consists of a corrupt finite output time series obtained in response to a known, nonzero, but otherwise arbitrary, input signal. We present a novel identification method for this problem. This method maps the available a priori and a posteriori information into an “uncertain model" of the plant, which is comprised of a nominal plant model, a bounded additive output noise, and a bounded additive model uncertainty. The upper bound on the model uncertainty is explicit and expressed in terms of both the l1and H∞ system norms. The identification method and the nominal model possess certain well-defined optimality properties and are computationally simple, requiring only the solution of a single linear programming problem. © 1995 IEEE
AB - In this paper we formulate and solve a worst-case sys- tem identification problem for single-input, single-output, linear, shift-invariant, distributed parameter plants. The available a priori information in this problem consists of time-dependent upper and lower bounds on the plant impulse response and the additive output noise. The available a posteriori information consists of a corrupt finite output time series obtained in response to a known, nonzero, but otherwise arbitrary, input signal. We present a novel identification method for this problem. This method maps the available a priori and a posteriori information into an “uncertain model" of the plant, which is comprised of a nominal plant model, a bounded additive output noise, and a bounded additive model uncertainty. The upper bound on the model uncertainty is explicit and expressed in terms of both the l1and H∞ system norms. The identification method and the nominal model possess certain well-defined optimality properties and are computationally simple, requiring only the solution of a single linear programming problem. © 1995 IEEE
UR - http://www.scopus.com/inward/record.url?scp=0029290421&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-0029290421&origin=recordpage
U2 - 10.1109/9.376090
DO - 10.1109/9.376090
M3 - 21_Publication in refereed journal
VL - 40
SP - 769
EP - 776
JO - IEEE Transactions on Automatic Control
JF - IEEE Transactions on Automatic Control
SN - 0018-9286
IS - 4
ER -