ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

退化模型×动态规划×
领域可靠性优化
方法族Regression modelProcess / pipeline
起源年份19981957
提出者Meeker, Escobar & LuRichard Bellman
类型Stochastic degradation path modelExact combinatorial optimization via recursive decomposition
开创性文献Meeker, W. Q., Escobar, L. A., & Lu, C. J. (1998). Accelerated degradation tests: modeling and analysis. Technometrics, 40(2), 89–99. DOI ↗Bellman, R. (1957). Dynamic Programming. Princeton University Press. ISBN: 978-0-691-07951-6
别名Accelerated Degradation Testing, Degradation Path Models, Performance Degradation Analysis, Bozunma ModelleriDP, Bellman's Principle of Optimality, Recursive Optimization, Dinamik Programlama
相关33
摘要Degradation models estimate product lifetime by tracking measurable performance characteristics—such as crack length, light output, or insulation resistance—over time rather than waiting for outright failure. Introduced in rigorous form by Meeker, Escobar, and Lu (1998), these models fit a stochastic degradation path to repeated measurements and define failure as the first time the characteristic crosses a predetermined threshold, enabling reliable lifetime inference from accelerated test data with very few or no observed failures.Dynamic Programming (DP) is an exact optimization technique introduced by Richard Bellman in 1957 for solving multi-stage decision problems. It decomposes a complex problem into simpler, overlapping subproblems, solves each subproblem once, and stores the results to avoid redundant computation. Grounded in the Principle of Optimality, DP guarantees globally optimal solutions whenever the problem exhibits overlapping subproblems and optimal substructure.
ScholarGate数据集
  1. v1
  2. 1 来源
  3. PUBLISHED
  1. v1
  2. 1 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: Degradation Models · Dynamic Programming. 于 2026-06-15 检索自 https://scholargate.app/zh/compare