Linganisha mbinu

	Mfumo wa Mabadiliko ya Matumizi ya Ardhi CA-Markov	Uchanganuzi wa Njia ya Gharama Chini / Umbali wa Gharama
Nyanja	Uchanganuzi wa Kimaeneo	Uchanganuzi wa Kimaeneo
Familia	Process / pipeline	Process / pipeline
Mwaka wa asili	1997	1994
Mwanzilishi	Cellular automata (Clarke) + Markov chain (Muller & Middleton)	Edsger Dijkstra (shortest path); GIS cost-surface adaptation
Aina	Spatio-temporal land-use change simulation	Raster cost-surface routing
Chanzo asilia	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.	Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269–271.
Majina mbadala	CA-Markov model, cellular automata Markov, land-use change simulation, CA-Markov arazi kullanımı modeli	cost-distance analysis, accumulated cost surface, least-cost corridor, en düşük maliyetli yol
Zinazohusiana	3	3
Muhtasari	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.	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.