Abstract
This paper introduces a factoring method for Dynamic Bayesian Networks (DBNs) based on Possible Conflicts (PCs), which aim to reduce the computational burden of Particle Filter inference. Assuming single fault hypothesis and known fault modes, the method allows performing consistency based fault detection, isolation and identification of continuous dynamic systems, with the unifying formalism of DBNs. The three tank system benchmark has been used to illustrate the approach. Two fault scenarios are discussed and a comparison of the behaviors of a DBN of the complete system with the DBN factors is also included. Comparison has confirmed that DBN computation is more efficient for factors than for the complete DBN.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
