Determination of set-membership identifiability sets - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Mathematics in Computer Science Année : 2014

Determination of set-membership identifiability sets

Résumé

This paper concerns the concept of set-membership identifiability introduced in \cite{jauberthie}. Given a model, a set-membership identifiable set is a connected set in the parameter domain of the model such that its corresponding trajectories are distinct to trajectories arising from its complementary. For obtaining the so-called set-membership identifiable sets, we propose an algorithm based on interval analysis tools. The proposed algorithm is decomposed into three parts namely {\it mincing}, {\it evaluating} and {\it regularization} (\cite{jaulin2}). The latter step has been modified in order to obtain guaranteed set-membership identifiable sets. Our algorithm will be tested on two examples.
Fichier principal
Vignette du fichier
mcsdoc8.pdf (361.74 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01067127 , version 1 (23-09-2014)

Identifiants

Citer

Laleh Hosseini-Ravanbod, Nathalie Verdière, Carine Jauberthie. Determination of set-membership identifiability sets. Mathematics in Computer Science, 2014, 8 (Issue 3-4), pp.391-406. ⟨10.1007/s11786-014-0201-1⟩. ⟨hal-01067127⟩
305 Consultations
117 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More