Table of Contents Author Guidelines Submit a Manuscript
Journal of Electrical and Computer Engineering
Volume 2017, Article ID 6175429, 7 pages
Research Article

Research on Fault Diagnosis for Pumping Station Based on T-S Fuzzy Fault Tree and Bayesian Network

College of Computer and Information Engineering, Hohai University, Nanjing 211100, China

Correspondence should be addressed to Chenming Li; nc.ude.uhh@mcl

Received 28 March 2017; Revised 22 May 2017; Accepted 27 June 2017; Published 2 August 2017

Academic Editor: Lei Zhang

Copyright © 2017 Zhuqing Bi et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


According to the characteristics of fault diagnosis for pumping station, such as the complex structure, multiple mappings, and numerous uncertainties, a new approach combining T-S fuzzy gate fault tree and Bayesian network (BN) is proposed. On the one hand, traditional fault tree method needs the logical relationship between events and probability value of events and can only represent the events with two states. T-S fuzzy gate fault tree method can solve these disadvantages but still has weaknesses in complex reasoning and only one-way reasoning. On the other hand, the BN is suitable for fault diagnosis of pumping station because of its powerful ability to deal with uncertain information. However, it is difficult to determine the structure and conditional probability tables of the BN. Therefore, the proposed method integrates the advantages of the two methods. Finally, the feasibility of the method is verified through a fault diagnosis model of the rotor in the pumping unit, the accuracy of the method is verified by comparing with the methods based on traditional Bayesian network and BP neural network, respectively, when the historical data is sufficient, and the results are more superior to the above two when the historical data is insufficient.