OPTIMALITY PROPERTIES IN FINITE-SAMPLE L(1) IDENTIFICATION WITH BOUNDED NOISE

被引:10
作者
KACEWICZ, B [1 ]
MILANESE, M [1 ]
机构
[1] POLITECN TORINO, DIPARTIMENTO AUTOMAT & INFORMAT, I-10129 TURIN, ITALY
关键词
L(1) IDENTIFICATION; BOUNDED NOISE; ALMOST-OPTIMAL ESTIMATES; ALMOST-OPTIMAL EXPERIMENTS;
D O I
10.1002/acs.4480090109
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper we investigate finite sample optimality properties for worst-case l(1) identification of the impulse response of discrete time, linear, time-invariant systems. The experimental conditions we consider consist of m experiments of length N. The measured outputs are corrupted by component-wise bounded additive disturbances with known bounds. The quantification of the identification error is given by the maximum l(1)-norm of the difference between the true impulse response samples and the estimated ones, where the maximum is taken with respect to all admissible plants and all admissible disturbances. First we show that for any given experimental condition, almost-optimal (within a factor of two) estimates can be obtained by solving suitable linear programmes. Then we study how experimental conditions affect the identification error. Optimality of the experimental data is measured by the diameter of information, a quantity which is at most twice as large as the minimal worst-case error. We show that the minimum number of experiments allowing us to minimize the diameter of information is m(*) = 2(N). The values of the diameter of information and the corresponding optimal inputs are derived for the two extreme experimental conditions m = 1 and m = 2(N).
引用
收藏
页码:87 / 96
页数:10
相关论文
共 22 条
[1]   L1-OPTIMAL FEEDBACK CONTROLLERS FOR MIMO DISCRETE-TIME-SYSTEMS [J].
DAHLEH, MA ;
PEARSON, JB .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1987, 32 (04) :314-322
[2]   LINEAR AND NONLINEAR ALGORITHMS FOR IDENTIFICATION IN H-INFINITY WITH ERROR-BOUNDS [J].
GU, GX ;
KHARGONEKAR, PP .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1992, 37 (07) :953-963
[3]  
Gubin LG., 1967, USSR COMP MATH MATH, V7, P1, DOI [10.1016/0041-5553(67)90113-9, DOI 10.1016/0041-5553(67)90113-9]
[4]   CONTROL ORIENTED SYSTEM-IDENTIFICATION - A WORST-CASE DETERMINISTIC APPROACH IN H-INFINITY [J].
HELMICKI, AJ ;
JACOBSON, CA ;
NETT, CN .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1991, 36 (10) :1163-1176
[5]  
JACOBSON CA, 1991, 1991 P AM CONTR C CH, P235
[6]  
KACEWICZ B, 1992, 31ST P IEEE C DEC CO, P56
[7]   OPTIMALITY OF CENTRAL AND PROJECTION ALGORITHMS FOR BOUNDED UNCERTAINTY [J].
KACEWICZ, BZ ;
MILANESE, M ;
TEMPO, R ;
VICINO, A .
SYSTEMS & CONTROL LETTERS, 1986, 8 (02) :161-171
[8]  
Ljung L., 1999, SYSTEM IDENTIFICATIO
[9]   ROBUST IDENTIFICATION AND GALOIS SEQUENCES [J].
MAKILA, PM .
INTERNATIONAL JOURNAL OF CONTROL, 1991, 54 (05) :1189-1200
[10]  
Milanese M., 1993, Journal of Complexity, V9, P427, DOI 10.1006/jcom.1993.1028