• English
    • français
  • Help
  •  | 
  • Contact
  •  | 
  • About
  •  | 
  • Login
  • HAL portal
  •  | 
  • Pages Pro
  • EN
  •  / 
  • FR
View Item 
  •   LillOA Home
  • Liste des unités
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
  • View Item
  •   LillOA Home
  • Liste des unités
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Exhaustive search of residuals computation ...
  • BibTeX
  • CSV
  • Excel
  • RIS

Document type :
Communication dans un congrès avec actes
Title :
Exhaustive search of residuals computation schemes using macro-graphs and invertibility constraints
Author(s) :
de Flaugergues, Vincent [Auteur]
Cocquempot, Vincent [Auteur] refId
Systèmes Tolérants aux Fautes [STF]
Merchez, Mireille [Auteur] refId
Lefebvre, Nicolas [Auteur]
Conference title :
IFAC Safeprocess 2009
City :
Barcelone
Country :
Espagne
Start date of the conference :
2009-06-30
Book title :
7th IFAC Symposium on Fault Detection, Supervision and Safety of Technical Processes
Publication date :
2009-06-30
English keyword(s) :
Structural analysis
Automotive applications
HAL domain(s) :
Sciences de l'ingénieur [physics]/Automatique / Robotique
English abstract : [en]
In this paper, a structural analysis of a model is performed with the objective to design fault indicators, i.e. residuals, which are used for Fault Detection and Isolation. The invertibility constraints of the relations ...
Show more >
In this paper, a structural analysis of a model is performed with the objective to design fault indicators, i.e. residuals, which are used for Fault Detection and Isolation. The invertibility constraints of the relations are considered at the early stage of the method, which gives some information on the calculability of the residuals. The set of all possible residuals is obtained by determining exhaustively the matchings in the structural model. A matching gives a computation path for the residual. In this article, we search for all realizable computation paths for all possible residuals. Even if the structural analysis is known to be a powerful method, this exhaustive search may be very expensive in computational time for high-dimensional models. The key element of this paper is the use of a reduced graph, called macro-graph, in order to reduce the complexity of the exhaustive residuals search. Our method is compared with the classical one and the complexity gain is proven. An academic example is taken to illustrate our method.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Source :
Harvested from HAL
Université de Lille

Mentions légales
Accessibilité : non conforme
Université de Lille © 2017