Comparer des méthodes
Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.
| Programmation dynamique bayésienne× | Programmation dynamique stochastique× | |
|---|---|---|
| Domaine | Simulation | Simulation |
| Famille | Process / pipeline | Process / pipeline |
| Année d'origine≠ | 1957 (Bellman DP); Bayesian extensions 1990s–2000s | 1957 |
| Auteur d'origine≠ | Bellman, R.; extended by Bayesian frameworks (Duff, Bertsekas) | Bellman, R.; formalized for stochastic settings by Puterman, M. L. |
| Type≠ | Sequential optimization with Bayesian belief updating | Sequential optimization under uncertainty |
| Source fondatrice≠ | Bertsekas, D. P. (1995). Dynamic Programming and Optimal Control. Athena Scientific, Belmont, MA. ISBN: 9781886529267 | Bellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780486428093 |
| Alias | BDP, Bayesian DP, Bayesian sequential optimization, Bayesian stochastic control | SDP, Markov Decision Process, MDP, Stochastic DP |
| Apparentées≠ | 4 | 6 |
| Résumé≠ | Bayesian Dynamic Programming (BDP) combines Bellman's dynamic programming framework with Bayesian inference to optimize sequential decisions when transition probabilities or reward structures are unknown. At each stage, the agent updates beliefs about the environment using observed outcomes, then computes an optimal policy that explicitly accounts for both immediate rewards and the value of information gained through exploration. | 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. |
| ScholarGateJeu de données ↗ |
|
|