Evolutionary Learning of Fire Fighting Strategies
The dynamic problem of enclosing an expanding fire can be modelled by a simple discrete variant in a grid graph. While the fire expands to all neighbouring cells in any time step, the fire fighter is allowed to block c cells in the average outside the fire in the same time interval. It was shown that the success of the fire fighter is guaranteed for \(c>1.5\) but no strategy can enclose the fire for \(c\le 1.5\). For achieving such a critical threshold the correctness (sometimes even optimality) of strategies and lower bounds have been shown by integer programming or by direct but often very sophisticated arguments. We investigate the problem whether it is possible to find or to approach such a threshold and/or optimal strategies by means of evolutionary algorithms, i.e., we just try to learn successful strategies for different constants c and have a look at the outcome. We investigate the variant of protecting a highway with still unknown threshold and found interesting strategic paradigms.
KeywordsDynamic environments Fire fighting Evolutionary strategies Threshold approximation
The authors would like to thank the anonymous reviewers for their valuable comments and suggestions.
- 6.Fogarty, P.: Catching the fire on grids. Ph.D. thesis, The University of Vermont (2003)Google Scholar
- 11.Ng, K., Raff, P.: Fractional firefighting in the two dimensional grid. Technical report, DIMACS Technical Report 2005-23 (2005)Google Scholar
- 12.Rechenberg, I.: Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Number 15 in Problemata. Frommann-Holzboog, Stuttgart-Bad Cannstatt (1973)Google Scholar