Optimal asymptotic identification under bounded disturbances

The intrinsic limitation of worst-case identification of linear time-invariant systems using data corrupted by bounded disturbances, when the unknown plant is known to belong to a given model set, is studied. This is done by analyzing the optimal worst-case asymptotic error achievable by performing experiments using any bounded input and estimating the plant using any identification algorithm. It is shown that under some topological conditions on the model set, there is an identification algorithm which is asymptotically optimal for any input, and the optimal asymptotic error is characterized as a function of the inputs. These results, which hold for any error metric and disturbance norm, are applied to three specific identification problems: identification of stable systems in the l/sub 1/ norm, identification of stable rational systems in the H/sub infinity / norm and identification of unstable rational systems in the gap metric. For each of these problems, the general characterization of optimal asymptotic error is used to find near-optimal inputs to minimize the error.<
>