방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 행위자 기반 모델링 (ABM)× | 최소 비용 경로 / 비용 거리 분석× | |
|---|---|---|
| 분야≠ | 시뮬레이션 | 공간분석 |
| 계열 | Process / pipeline | Process / pipeline |
| 기원 연도≠ | 1970s–1990s (formalized as a field) | 1994 |
| 창시자≠ | Thomas Schelling and Robert Axelrod (foundational contributions, 1970s–1990s) | Edsger Dijkstra (shortest path); GIS cost-surface adaptation |
| 유형≠ | Computational simulation method | Raster cost-surface routing |
| 원전≠ | Axelrod, R. (1997). The Complexity of Cooperation: Agent-Based Models of Competition and Collaboration. Princeton University Press. DOI ↗ | Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269–271. DOI ↗ |
| 별칭 | ABM, Ajan Tabanlı Modelleme (ABM), multi-agent simulation, individual-based modeling | cost-distance analysis, accumulated cost surface, least-cost corridor, en düşük maliyetli yol |
| 관련≠ | 5 | 3 |
| 요약≠ | 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. | 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. |
| ScholarGate데이터셋 ↗ |
|
|