Optimization of approximating networks for optimal fault diagnosis

被引:8
作者
Alessandri, A
Sanguineti, M
机构
[1] Univ Genoa, Dept Commun Comp & Syst Sci DIST, I-16145 Genoa, Italy
[2] Natl Res Council Italy, CNR, ISSIA, Inst Intelligent Syst Automat, I-16149 Genoa, Italy
关键词
model-based fault diagnosis; functional optimization; polynomially complex approximators; high-dimensional admissible solutions; nonlinear programing; stochastic approximation; optimal estimation;
D O I
10.1080/10556780512331318245
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
An optimization-based approach to fault diagnosis for nonlinear stochastic dynamic models is developed. An optimal diagnosis problem is formulated according to a receding-horizon strategy. This approach leads to a functional optimization problem (also called 'infinite optimization problem'), whose admissible solutions belong to a function space. As in such a context, the tools from mathematical programing are either inapplicable or inefficient, a methodology of approximate solution is proposed that exploits diagnosis strategies made up of combinations of a certain number of simple basis functions, easy to implement and dependent on some parameters to be optimized. The optimization of the parameters is performed in two phases. In the first, 'a-priori' knowledge of the statistics of the stochastic variables is used to initialize (off-line) the parameter values. In the second phase, the optimization continues on-line. Both off-line and on-line phases rely upon stochastic approximation algorithms. The overall procedure turns out to be effective in high-dimensional settings such as those characterized by a large dimension of the state space and a large diagnosis window. This favorable behavior results from certain properties of the proposed methodology of approximate optimization, such as polynomial bounds on the rate of growth of the number of parameterized basis functions, which guarantees the desired accuracy of approximate optimization. The effectiveness of the approach is confirmed by simulations in the context of a complex instance of the fault-diagnosis problem. The advantages over classical approaches to fault diagnosis are discussed and pointed out by numerical results.
引用
收藏
页码:235 / 260
页数:26
相关论文
共 37 条
[1]   Neural approximators for nonlinear finite-memory state estimation [J].
Alessandri, A ;
Parisini, T ;
Zoppoli, R .
INTERNATIONAL JOURNAL OF CONTROL, 1997, 67 (02) :275-301
[2]  
[Anonymous], 1974, APPL OPTIMAL ESTIMAT
[3]  
Baglietto M, 2003, APPL OPTIM, V82, P23
[4]   Numerical solutions to the Witsenhausen counterexample by approximating networks [J].
Baglietto, M ;
Parisini, T ;
Zoppoli, R .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2001, 46 (09) :1471-1477
[5]   Distributed-information neural control: The case of dynamic routing in traffic networks [J].
Baglietto, M ;
Parisini, T ;
Zoppoli, R .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 2001, 12 (03) :485-502
[6]   UNIVERSAL APPROXIMATION BOUNDS FOR SUPERPOSITIONS OF A SIGMOIDAL FUNCTION [J].
BARRON, AR .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (03) :930-945
[7]   Successive Galerkin approximation algorithms for nonlinear optimal and robust control [J].
Beard, RW ;
McLain, TW .
INTERNATIONAL JOURNAL OF CONTROL, 1998, 71 (05) :717-743
[8]  
Bellman R., 1957, DYNAMIC PROGRAMMING
[9]   HINGING HYPERPLANES FOR REGRESSION, CLASSIFICATION, AND FUNCTION APPROXIMATION [J].
BREIMAN, L .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (03) :999-1013
[10]   Applying experimental design and regression splines to high-dimensional continuous-state stochastic dynamic programming [J].
Chen, VCP ;
Ruppert, D ;
Shoemaker, CA .
OPERATIONS RESEARCH, 1999, 47 (01) :38-53