2012
DOI: 10.1021/ie201850k
|View full text |Cite
|
Sign up to set email alerts
|

Isolating Non-predefined Sensor Faults by Using Farthest First Traversal Algorithm

Abstract: In this study, we propose a knowledge-based approach for detection and isolation of predefined and nonpredefined sensor faults in fault tolerant control (FTC) of a three-tank system. Farthest first traversal algorithm (FFTA) of data mining is used for the first time for the classification of faults in a FTC system. Predefining here means that features of a fault and its effects are known before the fault is seen on the system. Therefore, if a predefined fault is detected on the system, it is isolated into a kn… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2015
2015

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 18 publications
0
1
0
Order By: Relevance
“…Intuitively, every prefix of a greedy permutation is as informative as possible about the whole set, so greedy permutations form a natural ordering in which to stream large data sets. Because of these properties, greedy permutations have many additional applications, including color quantization [Xia97], progressive image sampling [ELPZ97], selecting landmarks of probabilistic roadmaps for motion planning [MAB98], point cloud simplification [MD03], halftone mask generation [SMR04], hierarchical clustering [DL05], detecting isometries between surface meshes [LF09], novelty detection and time management for autonomous robot exploration [GGD12], industrial fault detection [AYE12], and range queries seeking diverse sets of points in query regions [AAYI + 13].…”
Section: Introductionmentioning
confidence: 99%
“…Intuitively, every prefix of a greedy permutation is as informative as possible about the whole set, so greedy permutations form a natural ordering in which to stream large data sets. Because of these properties, greedy permutations have many additional applications, including color quantization [Xia97], progressive image sampling [ELPZ97], selecting landmarks of probabilistic roadmaps for motion planning [MAB98], point cloud simplification [MD03], halftone mask generation [SMR04], hierarchical clustering [DL05], detecting isometries between surface meshes [LF09], novelty detection and time management for autonomous robot exploration [GGD12], industrial fault detection [AYE12], and range queries seeking diverse sets of points in query regions [AAYI + 13].…”
Section: Introductionmentioning
confidence: 99%