Bandingkan kaedah
Semak kaedah pilihan anda secara bersebelahan; baris yang berbeza akan diserlahkan.
| Pengaturcaraan Dinamik Berasaskan Ejen× | Pengaturcaraan Dinamik Multi-Objektif× | |
|---|---|---|
| Bidang | Simulasi | Simulasi |
| Keluarga | Process / pipeline | Process / pipeline |
| Tahun asal≠ | 1957 (DP); 1990s onward (ABM integration) | 1957-1975 |
| Pengasas≠ | Bellman, R. (DP foundation); Tesfatsion, L. et al. (ABM-DP integration) | Extension of Bellman (1957); formalized by multiple authors from 1970s onward |
| Jenis≠ | Hybrid simulation-optimization | Exact optimization — recursive multi-objective decomposition |
| Sumber perintis | Bellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780691079516 | Bellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780691079516 |
| Alias | ABDP, Agent-based DP, Multi-agent dynamic programming, ABM-DP | MODP, Multi-criteria dynamic programming, Vector dynamic programming, Pareto dynamic programming |
| Berkaitan | 5 | 5 |
| Ringkasan≠ | Agent-based dynamic programming (ABDP) embeds Bellman's dynamic programming framework within individual agents of an agent-based model, enabling each agent to solve sequential, multi-stage decision problems using backward induction or value-function iteration. The result is a population of optimizing agents whose interactions generate emergent system-level behavior. | Multi-Objective Dynamic Programming (MODP) extends Bellman's classical dynamic programming to settings where a decision-maker must optimize several competing objectives simultaneously across a sequence of stages. Rather than a single optimal policy, it produces a Pareto-optimal set of policies — each representing a distinct trade-off profile — by propagating vector-valued value functions backward through the state space. |
| ScholarGateSet data ↗ |
|
|