方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 策略情景动态规划× | 随机动态规划× | |
|---|---|---|
| 领域 | 仿真 | 仿真 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份 | 1957 | 1957 |
| 提出者≠ | Bellman, Richard E. | Bellman, R.; formalized for stochastic settings by Puterman, M. L. |
| 类型≠ | Sequential optimization with scenario branching | Sequential optimization under uncertainty |
| 开创性文献 | Bellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780691079516 | Bellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780486428093 |
| 别名 | PSDP, Policy-Scenario DP, Scenario-Based Dynamic Programming, Policy DP | SDP, Markov Decision Process, MDP, Stochastic DP |
| 相关≠ | 5 | 6 |
| 摘要≠ | Policy Scenario Dynamic Programming (PSDP) applies Bellman's recursive optimization framework to a set of pre-specified policy scenarios, enabling decision-makers to compare staged, sequential decisions under distinct future conditions. It decomposes a complex, multi-period policy choice into tractable sub-problems solved backward through time, yielding optimal action sequences for each scenario and a structured basis for scenario comparison. | 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数据集 ↗ |
|
|