Generalized least-squares fault detection filter

40Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A fault detection and identification algorithm is determined from a generalization of the least-squares derivation of the Kalman filter. The objective of the filter is to monitor a single fault called the target fault and block other faults which are called nuisance faults. The filter is derived from solving a min-max problem with a generalized least-squares cost criterion which explicitly makes the residual sensitive to the target fault, but insensitive to the nuisance faults. It is shown that this filter approximates the properties of the classical fault detection filter such that in the limit where the weighting on the nuisance faults is zero, the generalized least-squares fault detection filter becomes equivalent to the unknown input observer where there exists a reduced-order filter. Filter designs can be obtained for both linear time-invariant and time-varying systems.

Cite

CITATION STYLE

APA

Chen, R. H., & Speyer, J. L. (2000). Generalized least-squares fault detection filter. International Journal of Adaptive Control and Signal Processing, 14(7), 747–757. https://doi.org/10.1002/1099-1115(200011)14:7<747::AID-ACS619>3.0.CO;2-F

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free