Scheduled System Maintenance:
On Wednesday, July 29th, IEEE Xplore will undergo scheduled maintenance from 7:00-9:00 AM ET (11:00-13:00 UTC). During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

An Efficient Algorithm for Optimal Design of Diagnostics

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Aly, A.A. ; School of Industrial Engineering; The University of Oklahoma; 202 West Boyd, Suite 124; Norman, Oklahoma 73019 USA. ; Elsayedaly, Nael A.

Even though much work has been done in developing models to design diagnostic tests for fault isolation in electronic systems, there is still a lack of efficient, fast procedures. A new approach to the cost-effective design of fault isolation procedures is investigated. It is oriented specifically toward built-in-test (BIT) diagnostic subsystems for modular electronic equipment. The problem is formulated as a search tree. A branch and bound technique is used to find the optimal sequence of tests for the automatic BIT diagnostic to isolate a single malfunctioned unit among a group of Line Replaceable Units (LRUs). Dominance and branching rules are developed, and the algorithm is presented. An example problem is solved to illustrate the efficiency of the branch and bound algorithm. Computational results are given and discussed. The following conclusions can be drawn. 1. The branch and bound approach can be used successfully in designing a cost-effective fault-isolation procedure. Because of the branching and dominance rules, many of the non-optimal solutions are eliminated early in the solution procedure which could efficiently reduce the size of the required search tree, as well as the time and storage needed to find the optimal solution. 2. The proposed branch and bound algorithm is efficient in solving problems of size up to eight LRUs. 3. Even though the size of problems solved efficiently by the algorithm is limited to eight LRUs, this size is still greater than the size of any problem reported to be solved optimally in any previous work.

Published in:

Reliability, IEEE Transactions on  (Volume:R-32 ,  Issue: 5 )