Efficient Deployment of Patrols to Catch Arsonists

Forest fires are serious disasters that endanger the safety and property of residents. To deal with the arson-caused forest fires, we use security game theory to generate optimal patrol strategy under limited patrolling resources. The existing security game algorithms focus on a single behavior model to prevent attacks, while our work is to incorporate the secondary damage caused by the attack behavior into the optimization object. For forest fires, the security game algorithm only expects to catch arsonists in the forest, which is unreasonable in our opinion. Our algorithm incorporates the spread of fires into patrolling path planning so that defenders avoid being swallowed by fire via capturing the spread of it.