Results 271 to 280 of about 579,911 (284)

Experiment design in Nonlinear Set Membership identification

2007 American Control Conference, 2007
Experiment design for nonlinear systems is considered within a set membership framework. A quantity tauI, called radius of information, providing the worst-case identification error, is introduced. The radius of information is used to choose the most suitable experimental setting for identification.
openaire   +2 more sources

Set-membership identification of linear systems with input backlash

2006 American Control Conference, 2006
In this paper we present a two-stage procedure for deriving parameters bounds of linear systems with input backlash when the output measurement errors are bounded. First, using steady-state input-output data, parameters of the nonlinear dynamic block are tightly bounded.
CERONE, Vito, REGRUTO TOMALINO, Diego
openaire   +2 more sources

Unfalsified weighted least squares estimates in set-membership identification

IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, 1997
It is well known that the weighted least squares (WLS) identification algorithm provides estimates that are in general not in the membership set and in this sense are falsified estimates. This paper shows that: (1) if the noise bound is known, the WLS estimates can be made to lie in or converge to the membership set by choosing the weights properly and
Bai, EW, Qiu, L., Tempo, R.
openaire   +3 more sources

Optimality, approximation, and complexity in set membership H/sub ∞/ identification

IEEE Transactions on Automatic Control, 2002
Investigates the set membership identification of time-invariant, discrete-time, exponentially stable, possibly infinite-dimensional, linear systems from time or frequency-domain data, corrupted by deterministic noise. The aim is to deliver not a single model, but a set of models whose size in H∞ norm measures the uncertainty in the identification. The
MILANESE, Mario, TARAGNA, MICHELE
openaire   +2 more sources

Set-Membership Identification of Non-Linear Conceptual Models

1994
Identification of conceptual models nonlinear in the parameters from bounded-error data is considered. The assumption that errors are point-wise bounded implies that a set of parameter vectors is found instead of an ‘optimal’ parameter estimate. For our class of models, the Monte Carlo Set-Membership algorithm is appropriate to approximate the exact ...
openaire   +2 more sources

A systolic algorithm for adaptive set membership identification

International Conference on Acoustics, Speech, and Signal Processing, 2002
An adaptive set membership identification algorithm with a very flexible forgetting scheme is presented. In preliminary experiments, the method yields highly accurate estimates using very few of the data, and quickly adapts to fast-changing dynamics.
S.F. Odeh, J.R. Deller
openaire   +1 more source

Set Membership Identification for H ∞ Robust Control Design

IFAC Proceedings Volumes, 2000
Abstract The Set Membership H∞ identification of LTI discrete-time exponentially stable SISO systems, from noise corrupted measurements in the time and/or the frequency domain, is considered. The assumptions on the noise can account for information on its maximal magnitude and deterministic uncorrelation properties A test is given for validating the ...
Mario Milanese, Michele Taragna
openaire   +1 more source

Set-membership identification: Bayesian approach vs subpavings approach

21st Mediterranean Conference on Control and Automation, 2013
This paper deals with the problem of nonlinear set-membership identification. To solve this problem, a Bayesian approach is introduced and compared with the subpavings approach. The paper illustrates how the Bayesian approach can be used to determine the feasible parameter set and to check the consistency between measurement data and model.
Rosa M. Fernandez-Canti, Sebastian Tornil-Sin, Joaquim Blesa, Vicenc Puig   +3 more
openaire   +1 more source

Recursive Parallelotopic Bounding Algorithms in Set Membership Identification

IFAC Proceedings Volumes, 1996
Abstract In this paper, a procedure for the recursive approximation of the feasible parameter set of a linear model with a set membership uncertainty description is provided. Approximating regions of parallelotopic shape are considered. The new contribution of this paper consists in devising a general procedure allowing for block processing of q > 1 ...
L. Chisci, A. Garulli, A. Vicino, G. Zappa   +3 more
openaire   +1 more source

Set membership identification of simplified models

1996
.
GIARRÈ, Laura, M. MILANESE
openaire   +1 more source