1996
DOI: 10.1109/9.506230
|View full text |Cite
|
Sign up to set email alerts
|

Sequential approximation of feasible parameter sets for identification with set membership uncertainty

Abstract: In this paper the problem of approximating the feasible parameter set for identification of a system in a set membership setting is considered. The system model is linear in the unknown parameters. A recursive procedure providing an approximation of the parameter set of interest through parallelotopes is presented, and an efficient algorithm is proposed. Its computational complexity is similar to that of the commonly used ellipsoidal approximation schemes. Numerical results are also reported on some simulation… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
93
0
1

Year Published

2003
2003
2016
2016

Publication Types

Select...
7
2

Relationship

2
7

Authors

Journals

citations
Cited by 171 publications
(94 citation statements)
references
References 19 publications
0
93
0
1
Order By: Relevance
“…When F (k, θ) is linear, boxes, parallelotopes, ellipsoids or zonotopes are used to characterize the AFPS [25][26] [27]. In the nonlinear case, a minimum outer box can be determined by means of a set of optimization problems [24].…”
Section: Set-membership Parameter Estimation Problemmentioning
confidence: 99%
“…When F (k, θ) is linear, boxes, parallelotopes, ellipsoids or zonotopes are used to characterize the AFPS [25][26] [27]. In the nonlinear case, a minimum outer box can be determined by means of a set of optimization problems [24].…”
Section: Set-membership Parameter Estimation Problemmentioning
confidence: 99%
“…Such vertices can e.g. be found by using outer parallellotopic approximations as in (Vicino and Zappa, 1996). Each of the ¾ÄÒ Ö cases can now be determined by simple arithmetic operations, except when Ó Ò ÚÎ µ is split by a hyperplane, when LPs still has to be solved.…”
Section: On-line Search Treementioning
confidence: 99%
“…However, exact computation of FPS and nominal model parameters is a laborious task and requires a large amount of numerical computation, and hence is not usable in practical situations [25,26,27]. An alternative is to outbound the FPS by simple geometrical shapes such as "Ellipsoid" and "Parallelotope" (Fig.1) and consider their centre as the parameters of the nominal model [8,9,10,14]. Then, these shapes are mapped to the frequency domain (e.g.…”
Section: Non-statistical Based Robust Identification Of a Lightly Dammentioning
confidence: 99%
“…Both parametric and nonparametric uncertainties can be easily considered in SM identification problems. In [8], [9], [10] and [11] just parametric uncertainties are considered while [1], [4], [11], [13], [14], [15] and [16] deal with both parametric and non-parametric uncertainties. This approach to robust identification is more popular than SE and other statistical based approaches, since:…”
Section: Introductionmentioning
confidence: 99%