Reliability analysis of polynomial systems subject to p-box uncertainties

This paper proposes a reliability analysis framework for systems subject to multiple design requirements that depend polynomially on uncertain parameters. The values these polynomials take at a given realization of the uncertain parameters dictate whether that realization is a failure or a success point. In this paper, reliability analysis refers to the estimation or bounding of the probability of failure for a given model of the uncertainty. The probability distributions of the uncertain parameters are presumed to belong to a given probability box (also known as a p-box). This does not give sufficient information to determine the failure probability of such a system exactly, but does limit the range of values it might take. Two techniques for bounding this range are proposed herein. In the first approach, we calculate the p-box of the requirements functions by propagating all the hyper-rectangles defined by the p-box of the uncertain parameters. In the second approach, we find inner bounding sets of the safe and failure domains and search for the elements of the p-box that minimize and maximize the probability of such sets. Iterative refinement of the bounding sets allows tightening arbitrarily closely the offset between the actual failure probability range and the calculated outer bound. In both techniques, bounds of the functions describing the design requirements over hyper-rectangular sets are calculated and iteratively refined by expanding them using Bernstein bases.

[1]  Durga Rao Karanki,et al.  Uncertainty Analysis Based on Probability Bounds (P‐Box) Approach in Probabilistic Safety Assessment , 2009, Risk analysis : an official publication of the Society for Risk Analysis.

[2]  Nikolaos V. Sahinidis,et al.  Global Optimization of Multiplicative Programs , 2003, J. Glob. Optim..

[3]  Daniel Berleant,et al.  Arithmetic on Random Variables: Squeezing the Envelopes with New Joint Distribution Constraints , 2005, ISIPTA.

[4]  Tazid Ali,et al.  A Hybrid Method to Deal with Aleatory and Epistemic Uncertainty in Risk Assessment , 2012 .

[5]  N. Rowe Absolute Bounds on the Mean and Standard Deviation of Transformed Data for Constant-Sign-Derivative Transformations , 1988 .

[6]  Sonia Cafieri,et al.  On convex relaxations of quadrilinear terms , 2010, J. Glob. Optim..

[7]  S. Ferson,et al.  Different methods are needed to propagate ignorance and variability , 1996 .

[8]  Gary Tang,et al.  Mixed aleatory-epistemic uncertainty quantification with stochastic expansions and optimization-based interval estimation , 2011, Reliab. Eng. Syst. Saf..

[9]  Enrico Zio,et al.  Some considerations on the treatment of uncertainties in risk assessment for practical decision making , 2011, Reliab. Eng. Syst. Saf..

[10]  Christodoulos A. Floudas,et al.  A review of recent advances in global optimization , 2009, J. Glob. Optim..

[11]  M. Zettler,et al.  Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion , 1998, IEEE Trans. Autom. Control..

[12]  Didier Dubois,et al.  Representation, Propagation, and Decision Issues in Risk Analysis Under Incomplete Probabilistic Information , 2010, Risk analysis : an official publication of the Society for Risk Analysis.

[13]  Luc Jaulin,et al.  Applied Interval Analysis , 2001, Springer London.

[14]  Jay D. Johnson,et al.  A sampling-based computational strategy for the representation of epistemic uncertainty in model predictions with evidence theory , 2007 .

[15]  César A. Muñoz,et al.  Formalization of Bernstein Polynomials and Applications to Global Optimization , 2013, Journal of Automated Reasoning.

[16]  Alexander Shapiro,et al.  Worst-case distribution analysis of stochastic programs , 2006, Math. Program..

[17]  Andrew Paul Smith,et al.  Fast construction of constant bound functions for sparse polynomials , 2009, J. Glob. Optim..

[18]  James E. Smith,et al.  Generalized Chebychev Inequalities: Theory and Applications in Decision Analysis , 1995, Oper. Res..