Binary Decision Diagram Reliability for Multiple Robot Complex System

Binary Decision Diagram Reliability for Multiple Robot Complex System

DOI: 10.4018/978-1-5225-7368-5.ch076
(Individual Chapters)
No Current Special Offers


Assume a production system having multiple robots and work stations leading to a complex system. To evaluate the reliability of this system, a network of components is considered configuring a complex reliability network. A robotic network is considered which has perfect vertices and imperfect links. It means path links may fail with known probability. The authors obtain the reliability of the given network by using an exact method and with binary decision diagram. Binary decision diagram-based reliability evaluation involves three main steps. First, ordering the given path link. Second, generate the reliability function with the help of min-paths from source to sink. At last, apply Shannon's decomposition to compute the reliability of the given network.
Chapter Preview


Generally, complex systems in reliability are defined as a system having a combination of series, parallel, R out of N and standby components. Each of these models has the corresponding mathematical formulations for reliability computations leading to decompose the original system (or sub-system) into an equivalent one with a known cumulative distribution function (CDF) or reliability function. Continuing the decomposition procedure enables the decision maker to reduce the whole system to a unique component with a known CDF. For better understanding, an illustrative example for a complex system reduction is given in Figure 1. The system is composed of both series and parallel components which are reduced first to a series system and eventually to a one-component system.

It should be noted that the reduction methods explained before are not effective for all systems. In cases with complicated interrelations of components it is required to develop an efficient methodology. This methodology deals with subjects such as event trees, Boolean representations, coherent structures, cut sets and decompositions.

Network reliability analysis receives considerable attention for the design, validation, and maintenance of many real world systems, such as production, computer, communication, or power networks. The components of a network are subject to random failures, as more and more enterprises become dependent upon network or networked computing applications. Failure of a single component may directly affect the functioning of a network. So the failure probability of each component is a crucial consideration while considering the reliability of a network. There are so many exact methods for computation of network reliability (Bobbio et al., 2006). The network model is a directed stochastic graph G=(V, E), where V is the vertex set, and E is the set of directed edges. An incidence relation associates with each edge of G a pair of nodes of G, called its end vertices. The edges represent components that can fail with known probability. In real problems, these probabilities are usually computed from statistical data. The problem related with connection function is NP-hard. The same thing is observed for planar graphs (Provan, 1986).

Figure 1.

A complex system reliability



The word reliability can be traced back to 1816, by poet Coleridge before World War II the name has been linked mostly to repeatability (Saleh and Marais, 2006). A test (in any type of science) was considered reliable if the same results would be obtained repeatedly. In the 1920s product improvement through the use of statistical process control was promoted by Dr. Walter A. Shewart at Bell Labs. Around this time Wallodi Weibull was working on statistical models for fatigue. The development of reliability engineering was here on a parallel path with quality (Juran and Gryna, 1988). The modern use of the word reliability was defined by the U.S. military in the 1940s and evolved to the present. It initially came to mean that a product would operate when expected (nowadays called “mission readiness”) and for a specified period of time. In the time around the WWII and later, many reliability issues were due to inherent unreliability of electronics and to fatigue issues. In 1945, M.A. Miner published the seminal paper titled “Cumulative Damage in Fatigue” in an ASME journal. A main application for reliability engineering in the military was for the vacuum tube as used in radar systems and other electronics, for which reliability has proved to be very problematic and costly. The IEEE formed the Reliability Society in 1948. In 1950, on the military side, a group called the Advisory Group on the Reliability of Electronic Equipment, AGREE, was born. This group recommended the following 3 main ways of working:

  • Improve Component Reliability;

  • Establish quality and reliability requirements (also) for suppliers;

  • Collect field data and find root causes of failures.

Complete Chapter List

Search this Book: