2017
DOI: 10.1002/qre.2170
|View full text |Cite
|
Sign up to set email alerts
|

Using reliability analysis to support decision making in phased mission systems

Abstract: Because of the environments in which they will operate, future autonomous systems must be capable of reconfiguring quickly and safely following faults or environmental changes. Past research has shown how, by considering autonomous systems to perform phased missions, reliability analysis can support decision making by allowing comparison of the probability of success of different missions following reconfiguration. Binary decision diagrams (BDDs) offer fast, accurate reliability analysis that could contribute … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2020
2020
2025
2025

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 18 publications
0
3
0
Order By: Relevance
“…The set of reduced ordered BDDs for the model is unique and the order of variables along each path from the root node to the end node is the same. For a BDD, if the event occurs, then the BDD is traversed along the 1‐branch, otherwise, it is traversed along its 0‐branch 36,37 . The BDD is traversed in this way until a terminal node, and the model algorithm can be expressed as fbadbreak=ITE[]X,f1,f0goodbreak=Xf1goodbreak+X¯f0$$\begin{equation}f = ITE\left[ {X,{f}_1,{f}_0} \right] = X{f}_1 + \overline X {f}_0\end{equation}$$where ITE$ITE$ represents the if—then—else form, X$X$ represents that the event occurs, that is, X=1$X = 1$.…”
Section: Background Of Research Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…The set of reduced ordered BDDs for the model is unique and the order of variables along each path from the root node to the end node is the same. For a BDD, if the event occurs, then the BDD is traversed along the 1‐branch, otherwise, it is traversed along its 0‐branch 36,37 . The BDD is traversed in this way until a terminal node, and the model algorithm can be expressed as fbadbreak=ITE[]X,f1,f0goodbreak=Xf1goodbreak+X¯f0$$\begin{equation}f = ITE\left[ {X,{f}_1,{f}_0} \right] = X{f}_1 + \overline X {f}_0\end{equation}$$where ITE$ITE$ represents the if—then—else form, X$X$ represents that the event occurs, that is, X=1$X = 1$.…”
Section: Background Of Research Methodsmentioning
confidence: 99%
“…For a BDD, if the event occurs, then the BDD is traversed along the 1-branch, otherwise, it is traversed along its 0-branch. 36,37 The BDD is traversed in this way until a terminal node, and the model algorithm can be expressed as…”
Section: Et-ft Modelmentioning
confidence: 99%
“…Analytical modeling methods are often computationally more efficient than simulations and can provide accurate analysis results. Examples include state space models (eg, Markov chains, 10,14,15 semi‐Markov processes, 16,17 and Petri Nets 18,19 ), combinatorial methods (eg, Boolean algebra‐based decision diagrams 20–23 and universal generation functions 24,25 ), modular approaches, 26,27 and recursive methods 28–31 . The system reliability model constructed in the analytical method can be reused for reliability analysis under different component parameter values.…”
Section: Introductionmentioning
confidence: 99%