Bruno Gutiérrez
← All work

The Moving Firefighter Problem

My doctoral research: a novel graph-theory model of how fire spreads and how to contain it — solved two different ways, exact optimization and deep reinforcement learning, then compared head to head.

Read the published paperPeer-reviewed · open access (MDPI)
View paper →

The problem

Wildfire containment is a race: limited resources, a fire spreading across a landscape, and firefighters who must move to reach the next defensible point. I formalized this as the Moving Firefighter Problem (MFP) — a graph model that, unlike classic firefighter problems, accounts for the time it takes defenders to travel between nodes.

What I did

The work, in repositories

Methods

PythonReinforcement LearningMathematical OptimizationMIQCPCellular AutomataGraph Theory