Results 251 to 260 of about 579,911 (284)

Set-membership identification for adaptive control: input design

42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475), 2004
An input design to guarantee the boundedness and the decreasing volume of the uncertainty set is proposed in the scenario of open-loop identification for control. The estimated system is described by a linear time-invariant SISO system of known order n with unknown-but-bounded modeling error in discrete time.
Cadic, M.A., Polderman, J.W., Mareels, I.M.Y.   +2 more
openaire   +2 more sources

Hammerstein model identification with set membership errors

Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304), 2003
The problem of the Hammerstein dynamic system identification is considered when the measurement error is characterized in a set-membership context. The proposed approach accomplishes parameter identification through the introduction of a linearized augmented Hammerstein model whose parameter bounds allow us to derive overbounds to the Hammerstein model
G. Belforte, GAY, Paolo
openaire   +3 more sources

Model quality evaluation in set membership identification

Automatica, 1997
The authors consider identification of causal, single-output, linear time-invariant, discrete-time systems, which do not necessarily belong to the model class used. This case leads to a nonstandard set membership identification problem. The quality evaluation of different model classes is measured by the conditional radius of information, which is a ...
GIARRÈ, Laura, KACEWICZ B., MILANESE M.   +2 more
openaire   +3 more sources

Set-membership identification of resampled signals

2013 IEEE International Workshop on Information Forensics and Security (WIFS), 2013
The problem of resampling factor estimation as a means for tampering detection has been largely investigated. Most of the existing techniques rely on the analysis of cyclic correlations induced in the resampled signal. However, in this paper, a new direction is explored by addressing the same problem in terms of the set-membership estimation theory ...
Vazquez-Padin D., Comesana P., Perez-Gonzalez F.   +2 more
openaire   +1 more source

Set-membership identification for adaptive equalization

38th Midwest Symposium on Circuits and Systems. Proceedings, 2002
This paper proposes employing set-membership identification for adaptive equalization. A novel feature of the set-membership identification (SMI) is selective update of the estimates for the channel parameters. This is in sharp contrast with conventional recursive schemes such as recursive least-squares (RLS) which updates continually regardless of the
null Yih-Fang Huang, S. Gollamudi
openaire   +1 more source

Fault Detection Using Set-Membership Identification

IFAC Proceedings Volumes, 1996
Abstract In this paper, two novel approaches for detection of faults in dynamical systems are presented. Both approaches are based on set-membership identification, a system identification strategy which seeks to identify a set of parameters rather than a single point estimate.
J. Watkins, S. Yurkovich
openaire   +1 more source

Set--Membership Identification of Parametric Systems

Proceedings of the 45th IEEE Conference on Decision and Control, 2006
This paper considers the problem of robust, set membership identification of parametric LTI plants, using frequency domain data. We consider the case of noisy data, and provide tractable, LMI-based conditions for computing inner and outer approximations to the set of parameters so that the resulting plant is consistent with a given a priori information
M. Sznaier, R.S. Sanchez-Pena, V. Puig
openaire   +1 more source

Asymptotic properties of set membership identification algorithms

Systems & Control Letters, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Livstone, Mitchell M., Dahleh, Munther A.   +1 more
openaire   +2 more sources

A statistical approach to set-membership identification

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252), 2002
Set-membership identification (SMI) is cast in the statistical framework of M-estimation. Generalized adaptive algorithms are developed and it is shown that SMI algorithms are special cases of these. The statistical performance of SMI algorithms is also analyzed.
S. Nagaraj, null Yih-Fang Huang
openaire   +1 more source

Linear optimal algorithms in set membership identification

Proceedings of 1994 33rd IEEE Conference on Decision and Control, 2002
In this paper we investigate the optimality properties of linear identification algorithms. In particular, we study set membership identification problems, in which the output is linear in the parameters and it is corrupted by additive noise. The optimality properties of least squares algorithm are investigated in the case of bounded amplitude noise ...
M. Milanese, N. Elia
openaire   +1 more source