[GC2-6] Cellular automata

Cellular automata are a standard type of spatially explicit simulation model in which complex processes are modelled over space and time by means of a lattice of cells in which each cell defines its neighbouring cells. The spatial lattice composed of a two-dimensional grid of squared cells is the simple configuration of a cellular automata. Based on this regular configuration, each cell has associated a set of states that change at each iteration by the execution of transition rules, which take into account the state of each cell and those of its neighbours. As such, cellular automata consist of six defining components: a framework or lattice, cells, neighborhood, transition rules, initial conditions (states), and an update sequence (time). Cellular automata models map easily onto existing data structures widely used in geographic information systems, are easy to implement, and are able to show changes and spatial patterns in an understandable manner. All of this has contributed to their popularity in simulation modelling for applications such as measuring land use changes and monitoring disease spread

How to

this is a new concept

External resources

Learning outcomes

Self assessment

Completed (GI-N2K)

Outgoing relations

Incoming relations