| Summary: | 碩士 === 國立成功大學 === 化學工程研究所 === 82 === This thesis is concerned with the problem of set-membership
identification. It refers to a class of recursive algorithms
using ellipsoids to approximate the parameter set is formulated
by a bounded-error constraint.Three ellipsoid algorithms,
including the optimal bounding ellipsoid (OBE),the optimal
volume ellipsoid (OVE), and the fuzzy ellipsoidal set (FES),
are rederived. It is shown that the ellipsoid algorithm with
parallel cuts (EPC) and the OVE algorithm are the same. Due to
the fact that the algorithms of EPC and OVE are mathematical
equivalence, it can be concluded that the OVE and OBE
algorithms are mathematically equivalent. Since the FES
algorithm is developed very recently, it deserves detailed
studies. The main characteristics underlying the FES is further
explored. The above-mentioned ellipsoid algorithms are compared
and interpreted geometrically. Moreover, a unified formulation
for these algorithms is developed.
|
|---|
