• DocumentCode
    3282269
  • Title

    Approximate interval method for epistemic uncertainty propagation using Polynomial Chaos and evidence theory

  • Author

    Terejanu, G. ; Singla, P. ; Singh, T. ; Scott, P.D.

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Univ. at Buffalo, Buffalo, NY, USA
  • fYear
    2010
  • fDate
    June 30 2010-July 2 2010
  • Firstpage
    349
  • Lastpage
    354
  • Abstract
    The paper builds upon a recent approach to find the approximate bounds of a real function using Polynomial Chaos expansions. Given a function of random variables with compact support probability distributions, the intuition is to quantify the uncertainty in the response using Polynomial Chaos expansion and discard all the information provided about the randomness of the output and extract only the bounds of its compact support. To solve for the bounding range of polynomials, we transform the Polynomial Chaos expansion in the Bernstein form, and use the range enclosure property of Bernstein polynomials to find the minimum and maximum value of the response. This procedure is used to propagate Dempster-Shafer structures on closed intervals through nonlinear functions and it is applied on an algebraic challenge problem.
  • Keywords
    algebra; inference mechanisms; polynomial approximation; Bernstein form; Bernstein polynomials; Dempster-Shafer structures; algebraic challenge; approximate interval method; epistemic uncertainty propagation; evidence theory; polynomial chaos; probability distributions; Algorithm design and analysis; Chaos; Computer science; Data mining; Polynomials; Probability distribution; Random variables; Robots; Robust control; Uncertainty;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    American Control Conference (ACC), 2010
  • Conference_Location
    Baltimore, MD
  • ISSN
    0743-1619
  • Print_ISBN
    978-1-4244-7426-4
  • Type

    conf

  • DOI
    10.1109/ACC.2010.5530816
  • Filename
    5530816