مقایسهٔ روش‌ها

	مدل تغییر کاربری اراضی CA-Markov	سلولار اتوماتا	تحلیل مسیر کم‌هزینه / تحلیل هزینه-فاصله
حوزه	تحلیل فضایی	شبیه‌سازی	تحلیل فضایی
خانواده	Process / pipeline	Process / pipeline	Process / pipeline
سال پیدایش	1997	1940s–1950s (formalized); 1970 (Conway's Game of Life); 2002 (Wolfram's systematic classification)	1994
پدیدآور	Cellular automata (Clarke) + Markov chain (Muller & Middleton)	John von Neumann and Stanislaw Ulam (1940s–1950s); popularized by John Conway (1970) and Stephen Wolfram (1980s–2002)	Edsger Dijkstra (shortest path); GIS cost-surface adaptation
نوع	Spatio-temporal land-use change simulation	Grid-based computational simulation model	Raster cost-surface routing
منبع بنیادین	Clarke, K. C., Hoppen, S., & Gaydos, L. (1997). A self-modifying cellular automaton model of historical urbanization in the San Francisco Bay area. Environment and Planning B, 24(2), 247–261.	Wolfram, S. (2002). A New Kind of Science. Wolfram Media. ISBN: 978-1579550080	Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269–271.
نام‌های دیگر	CA-Markov model, cellular automata Markov, land-use change simulation, CA-Markov arazi kullanımı modeli	CA, Hücresel Otomat (Cellular Automata), lattice model, grid-based simulation	cost-distance analysis, accumulated cost surface, least-cost corridor, en düşük maliyetli yol
مرتبط	3	5	3
خلاصه	CA-Markov is a hybrid spatio-temporal model that projects land-use and land-cover change by combining a Markov chain — which predicts how much of each class will change — with cellular automata, which decide where that change happens. Widely used for urban-growth and land-cover forecasting, it answers both the quantity and the location of change, something neither component does well alone.	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.	Least-cost path analysis finds the route between two locations that minimizes accumulated travel cost across a landscape, rather than minimizing straight-line distance. By encoding terrain, slope, land cover, and other frictions into a cost surface and accumulating cost outward from a source, it identifies optimal corridors for roads, pipelines, trails, power lines, and wildlife movement — a core raster-GIS technique built on Dijkstra's shortest-path logic.