Identifiability guarantees that the mathematical model of a dynamic system is well defined in the sense that it maps unambiguously its parameters to the output trajectories. This paper casts identifiability in a set-membership (SM) framework and relates recently introduced properties, namely, SM-identifiability, μ-SM-identifiability, and ε-SM-identifiability, to the properties of parameter estimation problems. Soundness and ε-consistency are proposed to characterize these problems and the solution returned by the algorithm used to solve them. This paper also contributes by carefully motivating and comparing SM-identifiability, μ-SM-identifiability and ε-SM-identifiability with related properties found in the literature, and by providing a method based on differential algebra to check these properties.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
The paper considers a set membership joint estimation of variables and parameters in complex dynamic networks based on parametric uncertain models and limited hard measurements. A recursive estimation algorithm with a moving measurement window is derived that is suitable for on-line network monitoring. The window allows stabilising the classic recursive estimation algorithm and significantly improves estimate tightness. The estimator is validated on a case study regarding a water distribution network. Tight set estimates of unmeasured pipe flows, nodal heads, tank level and pipe resistances are obtained.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.