A New Algorithm for Simulating Wildfire Spread through Cellular Automata

Abstract

Cell-based methods for simulating wildfires can be computationally more efficient than techniques based on the fire perimeter expansion. In spite of this, their success has been limited by the distortions that plague the simulated shapes. This article presents a novel algorithm for wildfire simulation through Cellular Automata (CA), which is able to effectively mitigate the problem of distorted fire shapes. Such a result is obtained allowing spread directions that are not constrained to the few angles imposed by the lattice of cells and the neighborhood size. The characteristics of the proposed algorithm are empirically investigated under homogeneous conditions through some comparisons with the outcomes of a typical CA-based simulator. Also, using two significant heterogeneous landscapes, a comparison with the vector-based simulator FARSITE is discussed. According to the results of this study, the proposed approach performs significantly better, in terms of accuracy, than the CA taken as reference. In addition, at a far less computational cost, it provides burned regions that are equivalent, for practical purposes, to those given by FARSITE.