Set estimation

From testwiki
Revision as of 14:30, 7 January 2025 by imported>Vonkje (Robust case: diction)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Short description

In statistics, a random vector Template:Mvar is classically represented by a probability density function. In a set-membership approach or set estimation, Template:Mvar is represented by a set Template:Mvar to which Template:Mvar is assumed to belong. This means that the support of the probability distribution function of Template:Mvar is included inside Template:Mvar. On the one hand, representing random vectors by sets makes it possible to provide fewer assumptions on the random variables (such as independence) and dealing with nonlinearities is easier. On the other hand, a probability distribution function provides a more accurate information than a set enclosing its support.

Set-membership estimation

Set membership estimation (or set estimation for short) is an estimation approach which considers that measurements are represented by a set Template:Mvar (most of the time a box of Template:Tmath where Template:Mvar is the number of measurements) of the measurement space. If Template:Mvar is the parameter vector and Template:Mvar is the model function, then the set of all feasible parameter vectors is

P=P0f1(Y),

where Template:Math is the prior set for the parameters. Characterizing Template:Mvar corresponds to a set-inversion problem.[1]

Resolution

When Template:Mvar is linear the feasible set Template:Mvar can be described by linear inequalities and can be approximated using linear programming techniques.[2]

When Template:Mvar is nonlinear, the resolution can be performed using interval analysis. The feasible set Template:Mvar is then approximated by an inner and an outer subpavings. The main limitation of the method is its exponential complexity with respect to the number of parameters.[3]

Example

Consider the following model

ϕ(p1,p2,t)=(tp1)2+tp22+sin(p1+tp2),

where Template:Math and Template:Math are the two parameters to be estimated.

Figure 1. Bounded-error data

Assume that at times Template:Math, Template:Math, Template:Math, the following interval measurements have been collected: [y1]=[4,2],[y2]=[4,9],[y3]=[7,11], as illustrated by Figure 1. The corresponding measurement set (here a box) is

Y=[y1]×[y2]×[y3].

The model function is defined by

f(p1,p2)=[p12p22+sin(p1p2)p12+p22+sin(p1+p2)(2p1)2+2p22+sin(p1+2p2)]

The components of Template:Mvar are obtained using the model for each time measurement. After solving the set inversion problem, we get the approximation depicted on Figure 2. Red boxes are inside the feasible set Template:Mvar and blue boxes are outside Template:Mvar.

Figure 2 Feasible set for the parameters

Recursive case

Set estimation can be used to estimate the state of a system described by state equations using a recursive implementation. When the system is linear, the corresponding feasible set for the state vector can be described by polytopes or by ellipsoids [4] .[5] When the system is nonlinear, the set can be enclosed by subpavings. [6]

Robust case

When outliers occur, the set estimation method generally returns an empty set. This is due to the fact that the intersection between sets of parameter vectors that are consistent with the Template:Mvarth data bar is empty. To be robust with respect to outliers, we generally characterize the set of parameter vectors that are consistent with all data bars except Template:Mvar of them. This is possible using the notion of Template:Mvar-relaxed intersection.

See also

References

Template:Reflist