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 à base d'agents× | Programmation dynamique× | |
|---|---|---|
| Domaine≠ | Simulation | Optimisation |
| Famille | Process / pipeline | Process / pipeline |
| Année d'origine≠ | 1957 (DP); 1990s onward (ABM integration) | 1957 |
| Auteur d'origine≠ | Bellman, R. (DP foundation); Tesfatsion, L. et al. (ABM-DP integration) | Richard Bellman |
| Type≠ | Hybrid simulation-optimization | Exact combinatorial optimization via recursive decomposition |
| Source fondatrice≠ | Bellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780691079516 | Bellman, R. (1957). Dynamic Programming. Princeton University Press. ISBN: 978-0-691-07951-6 |
| Alias | ABDP, Agent-based DP, Multi-agent dynamic programming, ABM-DP | DP, Bellman's Principle of Optimality, Recursive Optimization, Dinamik Programlama |
| Apparentées≠ | 5 | 3 |
| Résumé≠ | 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. | 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. |
| ScholarGateJeu de données ↗ |
|
|