方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 确定性基于主体的建模× | 元胞自动机× | |
|---|---|---|
| 领域 | 仿真 | 仿真 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 1996 | 1940s–1950s (formalized); 1970 (Conway's Game of Life); 2002 (Wolfram's systematic classification) |
| 提出者≠ | Epstein, J. M. & Axtell, R. | John von Neumann and Stanislaw Ulam (1940s–1950s); popularized by John Conway (1970) and Stephen Wolfram (1980s–2002) |
| 类型≠ | Computational simulation — deterministic rule-based agents | Grid-based computational simulation model |
| 开创性文献≠ | Epstein, J. M., & Axtell, R. (1996). Growing Artificial Societies: Social Science from the Bottom Up. MIT Press. ISBN: 9780262550253 | Wolfram, S. (2002). A New Kind of Science. Wolfram Media. ISBN: 978-1579550080 |
| 别名 | D-ABM, Deterministic ABM, Rule-Based Agent Simulation, Fixed-Rule Agent-Based Model | CA, Hücresel Otomat (Cellular Automata), lattice model, grid-based simulation |
| 相关≠ | 4 | 5 |
| 摘要≠ | Deterministic Agent-Based Modeling (D-ABM) is a computational simulation approach in which autonomous agents follow fully specified, non-random behavioral rules within a structured environment. Every run with identical initial conditions produces identical outcomes, making the model fully reproducible and transparent for analysis of emergent system behavior without stochastic noise. | Cellular automata (CA) is a grid-based computational simulation model, first formalized by John von Neumann and Stanislaw Ulam in the 1940s–1950s and brought to wide attention by John Conway's Game of Life (1970) and Stephen Wolfram's systematic classification (2002), in which a lattice of cells — each holding a finite discrete state — evolves in discrete time steps according to local neighborhood interaction rules, causing complex global patterns to emerge from simple local specifications. |
| ScholarGate数据集 ↗ |
|
|