Determination of Set-Membership Identifiability Sets

详细信息    查看全文

• 作者：Laleh Ravanbod ; Nathalie Verdière ; Carine Jauberthie
• 关键词：Set ; membership identifiability ; Interval analysis ; 65G40
• 刊名：Mathematics in Computer Science
• 出版年：2014
• 出版时间：September 2014
• 年：2014
• 卷：8
• 期：3-4
• 页码：391-406
• 全文大小：522 KB
• 参考文献：1. Bourbaki N.: Elements of Mathematics. Springer, Berlin (1989)
  2. Braems, I., Jaulin, L., Kieffer, M., Walter, E.: Guaranteed numerical alternatives to structural identiability testing. In: Proceedings of the 40th IEEE CDC, pp. 3122-127. Orlando, USA (2001)
  3. Chabert G., Jaulin L.: Contractor programming. Artif. Intell. 173, 1079-100 (2009) CrossRef
  4. Jauberthie, C., Verdière, N., Travé-Massuyès, L.: Set-membership identifiability: definitions and analysis. In Proceedings of the 18th IFAC World Congress, pp. 12024-2029. Milan, Italie (2011)
  5. Jauberthie C., Verdière N., Travé-Massuyès L.: Fault detection and identification relying on set-membership identifiability. Ann. Rev. Control 73(1), 129-36 (2013) CrossRef
  6. Jaulin L., Kieffer M., Didrit O., Walter E.: Applied Interval Analysis, with Examples in Parameter and State Estimation, Robust Control and Robotics. Springer, Londres (2001)
  7. Kolchin E.R.: Differential Algebra and Algebraic Groups. Academic Press, New York (1973)
  8. Lagrange S., Delanoue N., Jaulin L.: On sufficient conditions of injectivity, development of a numerical test via interval analysis. J. Reliable Comput. 13, 409-21 (2007) CrossRef
  9. Lagrange S., Delanoue N., Jaulin L.: Injectivity analysis using interval analysis: application to structural identifiability. Automatica 44(11), 2959-962 (2008) CrossRef
  10. Ljung L., Glad T.: On global identifiability for arbitrary model parametrizations. Automatica 30, 265-76 (1994) CrossRef
  11. Milanese M., Vicino A.: Estimation theory for nonlinear models and set membership uncertainty. Automatica 27(2), 403-08 (1991) CrossRef
  12. Munkres J.R.: Topology a first courses. Prentice Hall, New Jersey (1975)
  13. Ra?ssi T., Ramdani N., Candau Y.: Set-membership state and parameter estimation for systems described by nonlinear differential equations. Automatica 40(10), 1771-777 (2004) CrossRef
  14. Verdière N., Denis-Vidal L., Joly-Blanchard G., Domurado D.: Identifiability and estimation of pharmacokinetic parameters of ligands of macrophage mannose receptor. Int. J. Appl. Math. Comput. Sci 15, 101-10 (2005)
  15. Verdière, N., Jauberthie, C., Travé-Massuyès, L.: Set-membership identifiability of nonlinear models. LAAS Report, Number 13001, p. 8 (2013)
  16. Walter E., Norton J., Piet-Lahanier H.H., Milanese M.: Bounding Approaches to System Identification. Perseus Publishing, New York (1996)
  17. Walter E., Piet-Lahanier H.: Estimation of parameter bounds from bounded-error data: a survey. Math. Comput. Simul. 32(5), 449-68 (1990) CrossRef
  
• 作者单位：Laleh Ravanbod (1)
  Nathalie Verdière (2)
  Carine Jauberthie (3) (4)
  
  1. Institut de Mathématiques de Toulouse, Université Paul Sabatier, 118 route de Narbonne, 31062, Toulouse Cedex 9, France
  2. Université du Havre, 25 rue Philippe Lebon, BP 1123, 76063, Le Havre Cedex, France
  3. CNRS, LAAS, 7 avenue du Colonel Roche, 31400, Toulouse, France
  4. Université de Toulouse, UPS, LAAS, 31400, Toulouse, France
  
• ISSN：1661-8289

文摘

This paper concerns the concept of set-membership identifiability introduced in Jauberthie et?al. (Proceedings of the 18th IFAC World Congress. Milan, Italie, 12024-2029, 2011). 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 mincing, evaluating and regularization (Jaulin et?al. in Applied interval analysis, with examples in parameter and state estimation, robust control and robotics. Springer, Londres, 2001). The latter step has been modified in order to obtain guaranteed set-membership identifiable sets. Our algorithm will be tested on two examples.