TY - GEN
T1 - Mode-set adaptation in multiple-model estimators for hybrid systems
AU - Li, X. Rong
AU - Bar-Shalom, Yaakov
PY - 1992
Y1 - 1992
N2 - In view of the numerous recent applications of multiple-model estimation algorithms, the choice of the set of models is a major issue. Often, for practical problems an algorithm using a fixed set of small number of models can not yield accurate results. Apart from the increase in computation, use of more models does not guarantee better performance - actually, it may yield even poorer results. To solve this problem, this paper introduces the concept of variable structure, i.e., adaptation of model set, and proposes several variable structure algorithms, as contrasted to the existing efforts of developing better implementable versions of the optimal estimator which uses a fixed set of models. The optimal variable structure estimator is derived and it is shown that the estimator usually considered to be the optimal is only the best within the fixed structure class. Three recursive algorithms are presented in a new framework based on graph theory. The superiority of the new approach is illustrated in numerical examples of a nonstationary noise identification problem.
AB - In view of the numerous recent applications of multiple-model estimation algorithms, the choice of the set of models is a major issue. Often, for practical problems an algorithm using a fixed set of small number of models can not yield accurate results. Apart from the increase in computation, use of more models does not guarantee better performance - actually, it may yield even poorer results. To solve this problem, this paper introduces the concept of variable structure, i.e., adaptation of model set, and proposes several variable structure algorithms, as contrasted to the existing efforts of developing better implementable versions of the optimal estimator which uses a fixed set of models. The optimal variable structure estimator is derived and it is shown that the estimator usually considered to be the optimal is only the best within the fixed structure class. Three recursive algorithms are presented in a new framework based on graph theory. The superiority of the new approach is illustrated in numerical examples of a nonstationary noise identification problem.
UR - https://www.scopus.com/pages/publications/0027042801
U2 - 10.23919/acc.1992.4792420
DO - 10.23919/acc.1992.4792420
M3 - 会议稿件
AN - SCOPUS:0027042801
SN - 0780302109
SN - 9780780302105
T3 - Proceedings of the American Control Conference
SP - 1794
EP - 1799
BT - Proceedings of the American Control Conference
PB - Publ by American Automatic Control Council
T2 - Proceedings of the 1992 American Control Conference
Y2 - 24 June 1992 through 26 June 1992
ER -