Process / pipelineSimulation / optimization
确定性动态规划 — 在参数已知情况下的精确序贯优化
确定性动态规划（DDP）是一种数学优化技术，它将多阶段决策问题分解为一系列更简单的子问题，并在所有系统参数——转移函数、成本和奖励——都确定已知时精确求解。它通过贝尔曼最优性原理保证了全局最优策略。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
来源
- Bellman, R. E. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780691079516
- Bertsekas, D. P. (2017). Dynamic Programming and Optimal Control (4th ed., Vol. 1). Athena Scientific, Belmont, MA. link ↗
如何引用本页
ScholarGate. (2026, June 3). Deterministic Dynamic Programming — Exact sequential optimization under known parameters. ScholarGate. https://scholargate.app/zh/simulation/deterministic-dynamic-programming
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- 确定性整数规划仿真↔ compare
- 确定性线性规划仿真↔ compare
- 马尔可夫模型仿真↔ compare
- 混合整数规划仿真↔ compare
- 多目标动态规划仿真↔ compare
- 随机动态规划仿真↔ compare