ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

确定性元胞自动机×基于主体的建模(ABM)×
领域仿真仿真
方法族Process / pipelineProcess / pipeline
起源年份1940s–1950s1970s–1990s (formalized as a field)
提出者John von Neumann and Stanislaw UlamThomas Schelling and Robert Axelrod (foundational contributions, 1970s–1990s)
类型Discrete deterministic grid simulationComputational simulation method
开创性文献von Neumann, J. (1966). Theory of Self-Reproducing Automata. University of Illinois Press, Urbana, IL. (Edited and completed by A. W. Burks.) link ↗Axelrod, R. (1997). The Complexity of Cooperation: Agent-Based Models of Competition and Collaboration. Princeton University Press. DOI ↗
别名Deterministic CA, Classical Cellular Automata, Rule-based CA, Finite Automata Grid ModelABM, Ajan Tabanlı Modelleme (ABM), multi-agent simulation, individual-based modeling
相关65
摘要Deterministic Cellular Automata (DCA) is a simulation method that models the evolution of complex systems through a regular grid of cells, each holding a discrete state, updated synchronously at each time step according to a fixed, deterministic rule applied to the cell and its neighbors. The outcome is fully reproducible given the same initial conditions and rule set.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.
ScholarGate数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: Deterministic Cellular Automata · Agent-Based Modeling. 于 2026-06-17 检索自 https://scholargate.app/zh/compare