Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Agent-baserad dynamisk programmering× | Agent-Based Modeling (ABM)× | |
|---|---|---|
| Ämnesområde | Simulering | Simulering |
| Familj | Process / pipeline | Process / pipeline |
| Ursprungsår≠ | 1957 (DP); 1990s onward (ABM integration) | 1970s–1990s (formalized as a field) |
| Upphovsperson≠ | Bellman, R. (DP foundation); Tesfatsion, L. et al. (ABM-DP integration) | Thomas Schelling and Robert Axelrod (foundational contributions, 1970s–1990s) |
| Typ≠ | Hybrid simulation-optimization | Computational simulation method |
| Ursprungskälla≠ | Bellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780691079516 | Axelrod, R. (1997). The Complexity of Cooperation: Agent-Based Models of Competition and Collaboration. Princeton University Press. DOI ↗ |
| Alias | ABDP, Agent-based DP, Multi-agent dynamic programming, ABM-DP | ABM, Ajan Tabanlı Modelleme (ABM), multi-agent simulation, individual-based modeling |
| Närliggande | 5 | 5 |
| Sammanfattning≠ | 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. | Agent-based modeling (ABM) is a computational simulation method, formalized through the work of Thomas Schelling and Robert Axelrod in the 1970s–1990s, that simulates the behavior of complex systems by specifying and running autonomous agents — individuals, firms, cells, or any bounded entity — whose local interactions with each other and with their environment collectively produce global, system-level patterns that could not be predicted from any single agent's rules alone. |
| ScholarGateDatamängd ↗ |
|
|