方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 确定性动态规划× | 随机动态规划× | |
|---|---|---|
| 领域 | 仿真 | 仿真 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份 | 1957 | 1957 |
| 提出者≠ | Richard E. Bellman | Bellman, R.; formalized for stochastic settings by Puterman, M. L. |
| 类型≠ | Exact sequential optimization algorithm | Sequential optimization under uncertainty |
| 开创性文献≠ | Bellman, R. E. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780691079516 | Bellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780486428093 |
| 别名 | DDP, Deterministic DP, Classical Dynamic Programming, Bellman Dynamic Programming | SDP, Markov Decision Process, MDP, Stochastic DP |
| 相关 | 6 | 6 |
| 摘要≠ | Deterministic Dynamic Programming (DDP) is a mathematical optimization technique that decomposes a multi-stage decision problem into a sequence of simpler subproblems, solving them exactly when all system parameters — transition functions, costs, and rewards — are known with certainty. It guarantees a globally optimal policy via Bellman's principle of optimality. | Stochastic Dynamic Programming (SDP) is a mathematical optimization framework for sequential decision problems where outcomes are partly random. It extends Bellman's principle of optimality to stochastic environments, representing problems as Markov Decision Processes (MDPs) and computing optimal policies by solving recursive value equations over states and time periods. |
| ScholarGate数据集 ↗ |
|
|