A Theoretically Rigorous Approach to Failure Prognosis

##plugins.themes.bootstrap3.article.main##

##plugins.themes.bootstrap3.article.sidebar##

Published Sep 24, 2018
David Acuña Marcos Orchard

Abstract

For more than twenty years, we have witnessed a continuous and significant growth in the scope and quality of research in Prognostics and Health Management (PHM). Prognostic algorithms and risk assessment metrics naturally play a critical role in this regard, since they provide the necessary information to take preventive measures and avoid catastrophic system failures. Unfortunately, the problem of failure prognostics has been treated many times from a heuristic, and mostly intuitive, standpoint. Indeed, the PHM community has often validated contributions to the state-of-the-art solely based on the performance experienced under specific run-to-failure experiments, and accepted lack of mathematical rigor in the formulation of the prediction problem itself. In this paper, we revisit the fundamentals of the prognostic problem, providing constructive criticism to inconsistencies found in approaches that have been adopted by many researchers within the PHM community. In addition, we propose a rigorous mathematical framework for failure prognostics, introducing failure probability measures for both discrete- and continuous-time dynamical systems that truly formalize the prognostic problem. We further discuss the philosophical implications of these novel notions in the context of a paradigm change, using as an illustrative example the problem of Lithium-Ion battery condition monitoring.

How to Cite

Acuña, D., & Orchard, M. (2018). A Theoretically Rigorous Approach to Failure Prognosis. Annual Conference of the PHM Society, 10(1). https://doi.org/10.36001/phmconf.2018.v10i1.469
Abstract 724 | PDF Downloads 530

##plugins.themes.bootstrap3.article.details##

Keywords

Prognosis; Failure Time; Probability of Failure; Risk Assessment; PHM Standards

Section
Technical Research Papers

Most read articles by the same author(s)

<< < 1 2