方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 随机动态规划× | 动态规划× | |
|---|---|---|
| 领域≠ | 仿真 | 优化 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份 | 1957 | 1957 |
| 提出者≠ | Bellman, R.; formalized for stochastic settings by Puterman, M. L. | Richard Bellman |
| 类型≠ | Sequential optimization under uncertainty | Exact combinatorial optimization via recursive decomposition |
| 开创性文献≠ | Bellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780486428093 | Bellman, R. (1957). Dynamic Programming. Princeton University Press. ISBN: 978-0-691-07951-6 |
| 别名 | SDP, Markov Decision Process, MDP, Stochastic DP | DP, Bellman's Principle of Optimality, Recursive Optimization, Dinamik Programlama |
| 相关≠ | 6 | 3 |
| 摘要≠ | 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. | 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数据集 ↗ |
|
|