Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| Programowanie celów bayesowskich× | Programowanie bayesowskie× | |
|---|---|---|
| Dziedzina | Symulacja | Symulacja |
| Rodzina | Process / pipeline | Process / pipeline |
| Rok powstania≠ | 1990s | 1957 (Bellman DP); Bayesian extensions 1990s–2000s |
| Twórca≠ | Rios Insua, D. and colleagues | Bellman, R.; extended by Bayesian frameworks (Duff, Bertsekas) |
| Typ≠ | Multi-objective optimization under uncertainty | Sequential optimization with Bayesian belief updating |
| Źródło pierwotne≠ | Rios Insua, D. (1990). Sensitivity Analysis in Multi-objective Decision Making. Springer-Verlag, Berlin. ISBN: 9783540528814 | Bertsekas, D. P. (1995). Dynamic Programming and Optimal Control. Athena Scientific, Belmont, MA. ISBN: 9781886529267 |
| Inne nazwy | BGP, Bayesian GP, Probabilistic Goal Programming, Bayesian Multi-Goal Optimization | BDP, Bayesian DP, Bayesian sequential optimization, Bayesian stochastic control |
| Pokrewne≠ | 6 | 4 |
| Podsumowanie≠ | Bayesian Goal Programming (BGP) integrates Bayesian statistical inference with classic goal programming to handle uncertainty in targets and parameters. Instead of treating goal thresholds as fixed constants, BGP encodes them as probability distributions, updates beliefs using observed data, and then solves the resulting probabilistic optimization problem to find solutions that satisfy multiple aspirational goals under uncertainty. | 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. |
| ScholarGateZbiór danych ↗ |
|
|