← Back to all news
arXiv Machine Learning By Ion Matei, Maksym Zhenirovskyy, Takuya Kurihana, Rohit Vupala, Anthony Wong

Aerial Wildfire Suppression Planning with a Hybrid CNN-Cellular Automata Fire Model

Read the original on arXiv Machine Learning →

The paper introduces a hybrid CNN‑cellular automaton (CNN‑CA) simulator for planning aerial wildfire suppression, trained on six historical fires. It jointly optimizes binary drop decisions and continuous aircraft trajectories while accounting for aircraft constraints, wind drift, and fuel reduction effects of water and retardant. The authors evaluate the method against random, tactical, greedy, and derivative‑free planners, showing significant reductions in simulated fire extent under a 2020 Bear Fire case study, though noting the results are conditional on the frozen simulator and not operational evidence.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv AI
2d ago

Interpretable Patch-Based Deep Learning for Wildfire Spread Prediction from Ensemble Simulations

The study evaluates deep learning surrogates for wildfire spread prediction, training four architectures on 10,584 high‑resolution simulations from Catalonia. Results show that only surface fuel load significantly predicts burn probability, and convolutional models mainly use distance to the fire front while a transformer model emphasizes fuel and terrain. When applied to a new region without retraining, the models still perform reasonably, with only a modest accuracy drop.

By Marcin Lawenda, Aleksandra Krasicka, David Caballero, Luis Torres, {\L}ukasz Szustak
llms
More like this →
arXiv AI
Aug 20

Wildfire Suppression: Complexity, Models, and Instances

The paper investigates how to allocate wildfire suppression resources over time on a graph-based landscape model. It proves the problem and two variants are strongly NP-complete on planar graphs and weighted directed grids, and remains hard even when all resources are released simultaneously. The authors introduce a new mixed-integer programming formulation that outperforms previous methods, and present a physics‑grounded instance generator based on Rothermel's model to benchmark algorithms on realistic scenarios.

By Gustavo Delazeri, Marcus Ritt
benchmarks
More like this →