WorksMathematics
On the Minimum Speed for a Fire Blocking Problem
Abstract
We consider a dynamic blocking problem: a fire, starting on a bounded open set , propagates in the plane with unit speed in all directions. To block it, a barrier can be constructed in real time, at speed . A long standing conjecture by the first author states that the fire can be entirely surrounded by the barrier, in finite time, if and only if . The present paper improves on earlier lower bounds. Namely, if we show that the fire cannot be blocked. We also prove that, if , the fire cannot be blocked by constructing a barrier which is a simple closed curve. More precisely, if the barrier does not contain purely delaying arcs, i.e.~arcs which are eventually surrounded by the fire on both sides, then for the region burned by the fire at time has area .
Introduction
Aim of this note is to analyze the dynamic blocking problem introduced in [7], originally motivated by the control of wild fires or of the spatial spreading of a contaminating agent.
At each time , we denote by the burned region. In the absence of control, we assume that the set grows uniformly in all directions, namely
Here is a fixed (nonempty) bounded open set, describing the region burned by the fire at the initial time . In our model, the spreading of the fire can be controlled by constructing barriers. In mathematical terms, we thus assume that the controller can construct a one-dimensional rectifiable curve which blocks the spreading of the fire. Calling the portion of the wall constructed within time , and denoting by the one-dimensional Hausdorff measure, we assume:
(A1) For every one has .
(A2) For every , the total length of the barrier satisfies
By (A1), after a portion of the barrier has been constructed, it remains in place forever and cannot be moved to any other location. The constant in (1) is the speed at which the wall is constructed. A barrier satisfying (A1)–(A2) will be called a -admissible strategy. By constructing barriers, the burned set is reduced. Indeed, this set is
In the above setting, following [7] we consider
(BP) Blocking Problem. Given an initial bounded open set , find an admissible strategy such that the corresponding reachable sets remain uniformly bounded.
In other words, we seek a strategy such that
for some radius sufficiently large. A key question that still remains open is
(Q) For which construction speeds can the fire be blocked?
By rescaling argument, it is clear that the answer does not depend on the initial set . Indeed, if is a -admissible strategy that blocks a fire starting from the set , then for every the rescaled strategy
is a -admissible strategy that blocks a fire initially burning on the set . W.l.o.g. one can thus assume that is the unit disc.
A long standing conjecture by the first author is that the fire can be blocked only if . In this direction, the following results are known.
When the fire can be blocked. When it cannot be blocked [7].
If the fire propagation is restricted to a half plane, then it can be blocked if and only if , see [11].
(4) If , the fire cannot be blocked [19].
In the present note we point out a very simple argument showing that, when , the fire cannot be blocked. Indeed, calling the area of the burned region at time , by the isoperimetric inequality the boundary of the burned set has length . Of this boundary, at most a portion of length can be covered by walls. On the remaining portion the fire expands freely (see Figure 1, left). This yields the lower bound
Figure 1. Left: by the isoperimetric inequality, at any time the portion of the boundary where the fire expands has length . Right: since for the barrier must contain , at one of the two times or the inequality (3) must be strict. For this reason, the bound in (10) can be slightly improved.
When , this differential inequality yields for some and all , showing that the fire cannot be blocked.
This lower bound on the blocking speed can be improved by observing that, for any , the barrier must contain (see Figure 1, right). Hence at one of the two times or the inequality (1.3) must be strict. A lower bound on the sum can now be obtained by looking at a double-bubble minimization problem, for the weighted sum of the perimeters of two sets with areas and .
Given a time , for any couple of times and the bounds known for the double-bubble problem [1, 16, 18] provide a sharper estimate on the lengths of the free boundaries and where the fire expands. In particular, when an integration yields
for some and all . Again, this shows that the fire cannot be blocked.
The last section of the paper is concerned with the case where the entire barrier is a Jordan curve, i.e. a simple closed curve. In such case we show that the fire can be blocked if and only if . If and the barrier does not contain purely delaying arcs, i.e. arcs that are eventually surrounded by the fire from both sides, we prove that the area of the burned set satisfies . This indicates that, if a -admissible blocking strategy were to exist for some , it would have to contain some barriers whose only purpose is to delay the spreading of the fire. As time increases, these barriers eventually lie in the interior of the closure of the burned set.
For the definition and properties of rectifiable sets we refer to [3, 14, 17]. Related problems of fire confinement have been studied in [5, 15]. In connection with a cost functional accounting for the value of the burned region plus the cost of constructing the barrier, the existence of optimal barriers was proved in [9, 13]. Necessary conditions for optimality, describing each arc of the optimal barrier as the solution to a suitable ODE, were derived in [7, 12, 20].
Preliminary results on the minimum time function
Throughout this section we assume that is a bounded open set, whose boundary has finite length: .
Consider the minimum time function associated with an admissible strategy :
with the convention .
Following [3, 14], by a rectifiable set we mean a set which can be decomposed as , where , , and is contained in a countable union of Lipschitz continuous curves. We say that the rectifiable set is complete if it contains all of its points of positive upper density:
We recall that, if is any rectifiable set (possibly not complete), the closure may well be the entire plane . However, the union
is a complete rectifiable set, with . Throughout the following, we refer to as the completion of the set .
Following [9, 13], an admissible strategy is called complete if, for every ,
and moreover contains every point satisfying
We recall that by [13 Theorem 1] the minimum-time function corresponding to an admissible strategy satisfies the following regularity properties. For every , the truncation satisfies
and moreover the jump set of and the absolutely continuous part of its gradient satisfy
We next relate the growth of the burned area to the free front. Here and in the sequel, denotes the Lebesgue measure of a set , while denotes its reduced boundary (see [3, 17] for precise definitions).
Proposition 2.1 Let be a complete, admissible strategy and set , with . Then is nondecreasing and has finite perimeter for almost every . For such times, define
Then
Moreover, for all there holds
Proof. Fix . By the coarea formula applied for the absolutely continuous part of the gradient of , we have
Next, we claim that, for almost every , up to -negligible sets,
Indeed, for almost every time , we claim that the following holds. For -a.e. , the left and right traces satisfy
This is obtained using Fubini’s theorem:
Therefore, for outside a negligible set,
If a point additionally belongs to , then this means that the upper trace is greater than and the lower trace is less than , i.e. , for -a.e. point in this intersection. Together with (2.6) this proves the claim. Therefore, for such , we immediately obtain . The second inclusion in (2.4) follows by the assumption that is complete.
Consequently,
Remark 2.1 A more careful proof would show that (2.3) holds with equality. However, this is not needed for our present purposes.
An elementary lower bound on the blocking speed
In this section we provide a first, elementary lower bound for the minimum speed blocking the fire. We recall that is the area of the burned region at time , given an admissible strategy . We assume here that the initial set is the unit ball, so that .
Theorem 3.1 Let be any admissible strategy. In the above setting, if , then
In particular, when one has
hence the fire cannot be contained.
Proof. By Proposition 2.1, there holds
for a.e. . On the other hand, the barrier constructed up to time has length at most . Therefore
The planar isoperimetric inequality yields
Now set
and choose so that
Such a number exists precisely when . Indeed
Moreover, by (13)
Therefore
We now observe . Moreover, at any time where , by (12) one has
A standard comparison argument now yields
At the critical value the equation (13) has the double root . Hence
showing that the fire cannot be blocked. Of course, the same conclusion holds for every .
Improving the lower bound
The earlier inequality (12) did not use the fact that for different times the sets belong to the same growing barrier. Relying on that additional information, the estimate can be somewhat improved.
Recall the definition of the active wall at time , that is
Notice that the remaining portion of the barrier consists of points where (see Figure 2)
Figure 2. Left: the solution to the double-bubble problem provides a lower bound on the lengths of the portions , of the boundaries where the fire expands freely, at the two times . Right: the portion of the barrier between the points and is the active wall at time . The remaining portions do not restrict the instantaneous fire propagation, because either they have not yet been reached by the fire, or they are already fully surrounded by it.
either the barrier has not yet been touched by the fire,
or the fire has already surrounded the barrier on both sides.
Fix two times where Proposition 2.1 applies, and consider the set
Note that these are the points which lie on an active wall at time , which remains active until time .
Introduce the function
The sets
form a partition of . In the interfaces between consecutive phases have weight , while the interface separating directly from the exterior has weight .
In the following, recalling (2.2) we define
to be the length of the advancing fire front, at time .
Proposition 4.1 There is a set such that for every , there holds
Proof. There holds
Since the barrier is increasing in time,
Using (1.1) gives (4.2).
Double-bubble variational problems
We consider the following optimization problem for sets of finite perimeter in the plane. As a convention, in the following let , and let
Here are disjoint up to negligible sets.
(DBP) (Double Bubble Problem). Given , find two disjoint regions with areas respectively, which minimize the weighted sum of perimeters:
The weighted double-bubble theorem of Lawlor [16] identifies the minimizer with the standard weighted double bubble made of three circular arcs, as shown in Figure 3. The minimum cost has the following properties:
Figure 3. The optimal shape of the double bubble.
Remark 4.1 Applying the definition of to the two sets and , one immediately obtains
The following monotonicity property will also be useful.
Lemma 4.1 Let be the minimum cost for the problem (DBP) with areas . Let and . Then for all there holds
Proof. Set
Here is the area of the first chamber and is the total enclosed area. Increasing with fixed adds area to the second chamber, whereas increasing with fixed transfers area from the second chamber to the first.
We shall prove that, for fixed , the minimum of on is attained at one of its endpoints, and then compare both endpoint values with .
We first recall the junction condition for a weighted double bubble; see [16 Section 6]. At each junction, let be vectors tangent to , respectively, directed away from the junction, normalized so that
The necessary condition for optimality yields
Taking the scalar product of (4.8) with , , one obtains
Thus the two arcs and having weight 1 meet orthogonally, while the arc with weight forms an angle with and .
Step 1. Place the two junctions at , with . Let be the signed angle between the downward vertical and the tangent to the internal arc at the upper junction, positive when the arc bends into the second chamber (see Figure 3).
At the upper junction, the tangent relations just established give
Here the direction of is chosen along the exterior arc of the second chamber, and then follows from (4.8). Since both junctions lie on the vertical axis, the exterior circles of and have radii
respectively. Imposing that these radii are positive, we obtain the parameter range
In this step, we prove that the area fraction
is a smooth, strictly decreasing function of on this interval, with limits 1 and 0 at its two endpoints. This is a quite intuitive fact: when increases, from Figure 3 we expect the area fraction of the second chamber to increase. This can be justified by elementary calculations, or the following scaling/uniqueness argument. By contradiction, assume that is not a monotone function of . Then for two values , one has . However, we know that (see e.g. [16]) that for a given there exists a unique double bubble satisfying the tangent relations (22) with given total area. Since the angles are not changed by dilations, this would contradict the above uniqueness of double bubbles.
Thus the map is a smooth bijection from onto with nonvanishing derivative. The inverse function theorem gives a smooth inverse , satisfying
Step 2. We now prove that, for fixed , the function first increases and then decreases. This will imply
We work with bubbles of prescribed total area , translated so that the junctions occur at the points . Their scale is allowed to vary with .
We calculate the derivatives of the function , which can be done via a standard Lagrange-multiplier argument. In fact, by the Lagrange multiplier theorem, there exist such that, calling
there holds, for an optimal configuration with areas , that
Here must be the curvature of the boundary of the exterior arc of multiplied by the weight at that point. By (24), the curvatures of the two exterior arcs, multiplied by their respective weights, are
Notice in passing that the curvature coefficient on the internal arc, for a displacement from towards , is
In particular, this is the difference of the two weighted exterior curvatures. Thus
Since and , this becomes
Now Step 1 provides a smooth family of minimizing configurations for , parametrized by . Keeping fixed, we thus obtain
Geometrically, transferring area from the second chamber to the first increases the cost when the internal arc bends into the second chamber. The derivative vanishes when the interface is straight, and becomes negative when it bends into the first chamber. Its sign therefore depends only on .
By Step 1, decreases strictly from to as increases from 0 to . Since , the right hand side of (26) is positive until the unique configuration with , and becomes negative afterwards. Hence has exactly one interior maximum and no interior minimum.
The function can be easily calculated at the endpoints; in fact, when the total area is equal to , the optimal configuration is just a circle, with perimeter weighted by 1, while is again a circle, but with perimeter weighted by . This yields immediately
Since has a unique local maximum in , we obtain
as claimed.
Step 3. In this step we show that
Consider the bubble with and . By the tangency relations (23), the circles carrying , and have centers , and , and radii 1, and , respectively.
It is easy to see that in this case
The lengths of the two exterior arcs and the internal arc are, respectively,
Thus the total area is and the weighted perimeter is
Dilating this bubble to total area , using (18), gives
Since
by Step 1 we obtain that that whenever
By Step 2 and continuity at , the map is increasing on . Therefore we finally get
Step 4. We now compare both endpoints from Step 2 with . For , the first-variation formula in Step 2 yields
because and . Thus adding area to the second chamber while keeping the first one fixed increases the minimum cost. For , the same monotonicity follows directly from . In either case,
Concerning the other endpoint, Step 3 and give
Combining these inequalities with the endpoint-minimum property established in Step 2, we obtain
which is the desired conclusion.
An improved lower bound
Define
and set
The two arguments of correspond to the area at the earlier time and the area gained between the two times, since . A numerical evaluation of the integral defining gives that the constant yields
Theorem 4.1 Let be a -admissible strategy and let , with . If , then
In particular, the fire cannot be blocked.
Proof. Suppose that (29) fails and let
Since is nondecreasing and , we have and
For almost every , both and are good times for Proposition 2.1. Since
we can apply Lemma 4.1 with , . Combining the lemma with (20), Proposition 4.1, and the scaling identity (18), we obtain
Integrating over and using (6) to estimate the right hand side gives
But and , hence (31) implies
contradicting . □
The choice of is optimal within this quadratic comparison argument. Indeed, with a general coefficient , the same proof gives a contradiction whenever
The largest threshold is therefore , attained at .
Barriers which are Jordan curves
In this final section we examine the case where the entire barrier is a Jordan curve. When it is well known [7] that there exists an admissible strategy which constructs two arcs of logarithmic spirals and completely surrounds the fire. Once completed, the entire barrier is a Jordan curve.
On the other hand, the following intuitive argument (already sketched in [4]) shows that a strategy which block the fire by constructing a Jordan curve can be admissible only if the construction speed is .
Assume that the fire starts from the unit ball centered at the origin. As shown in Figure 4, let be the location where the last brick of the wall is put in place, say at time . Then the entire wall must be constructed before the fire can reach the point . Since is the construction rate, this implies
Figure 4. If the entire barrier is a simple closed curve, then , where each of the two portions has length greater than the length of . Therefore, the time needed for the fire to reach any point of is strictly smaller than half of the length of .
Let be a path with minimum length, contained inside the region bounded by , joining the origin with . By minimality, the first portion of must be a segment. We prolong this segment backward until it crosses a first point . Call this longer path connecting with . Moreover, call respectively the two portions of , covered when traveling from to clockwise and counterclockwise, respectively. Since is a simple closed curve, the lengths of these paths satisfy
Since (otherwise the fire escapes from before the wall is completed), we thus conclude
Hence .
We observe, however, that no contradiction is reached if and the barrier is not a simple closed curve.
Toward a more rigorous proof, we recall some results from [10]. Let be a complete rectifiable set. The set reached by the fire at time in the presence of the barrier is then defined as
We also define . We say that the complete, rectifiable set is -admissible if, for every , the set
satisfies (1.1), i.e. it can be constructed within time . We now consider:
(BP′) Find an admissible rectifiable set such that the corresponding reachable set is bounded.
The main result in [10] shows that, under the assumptions (A1)–(A3), the two formulations of the blocking problem (BP) and (BP′) are equivalent.
Given a rectifiable set , we define the corresponding multifunction according to (5.2). Conversely, given an admissible strategy , we consider the set
The following theorem was proved in [10].
Theorem 5.1 In the above setting, there exists an admissible strategy with which solves the blocking problem (BP) if and only if there exists an admissible rectifiable set which solves (BP′).
We can now prove:
Theorem 5.2 Let be a Jordan curve with finite length, blocking a fire initially starting on a bounded open set . Then can be -admissible only if .
Proof. 1. Let . We will show that every point can be reached by the fire within time . This implies that . Hence
As a consequence, if , then is not -admissible.
2. Denote by the bounded, open, connected component of . Note that its boundary is , while its closure is . By a translation, we can assume that the initial burned set contains the open ball centered at the origin with radius . We consider the path distance between points in ,
Since has bounded length, the existence of a minimizing path follows from a standard compactness argument.
As proved in Lemma 2 of [11], since the Jordan domain is simply connected, the maximum distance between two points in is achieved on the boundary:
Given any two distinct points , let be the arcs travelled by moving along from to in the clockwise and in the counterclockwise direction, respectively. Clearly , and hence
Next, consider any point . By (36) there is a path starting from the origin and reaching , with length . Since contains a ball of radius centered at , the path contains an initial arc connecting the origin to a point with . Removing this arc, we obtain a shorter path connecting with , with length . Hence
In this final step we prove that, for any , there exists a path starting inside and reaching a point within time , without ever touching the barrier .
For sufficiently small , call the open neighborhood with radius around the set and let be the connected component of which intersects . Note that is simply connected. By choosing small enough, we also have
We now repeat the previous argument, replacing with the boundary and with a point . This yields the existence of a path , entirely contained inside , joining the point with . Moreover, the length of this path satisfies
Since is a Jordan curve with finite length, we have [2]
We thus conclude that
Hence is not -admissible for any .
We observe that the condition that is a Jordan curve implies
where denotes the boundary of the unbounded component of a set .
When the construction speed is , the next theorem gives a lower bound on the area of the burned set, assuming that (5.7) holds. As before, by we denote the Lebesgue measure of a set .
Theorem 5.3 For any , setting , the following holds. If is a -admissible strategy with the property (5.7), then the set burned by the fire satisfies
Proof. 1. By contradiction, assume that there exists a such that
where is a -admissible strategy with the property (5.7). We claim that in this case we can select an earlier time such that
Otherwise, if for all , then by (2.3)
reaching a contradiction.
Since , we deduce
Now take
and set
Since is connected, is a Jordan curve with length
We claim that the strategy
is -admissible. Indeed, for we have
Moreover, when by (38) one has
This shows that the sets satisfy (A1). To prove (A2) we observe that
while for this admissibility condition follows from (40).
3. Adopting the -admissible strategy (41), the fire propagation is completely stopped at time . However, by Theorem 5.2 this is possible only if . Taking we thus obtain a contradiction. This proves the result.
Use of AI tools. The authors acknowledge the use of ChatGPT as an auxiliary research tool. While the idea of considering two distinct times to control the evolution of the burned region arises naturally, the specific idea of using a weighted double-bubble configuration as a comparison was suggested by GPT-6 Astra, together with the weaker estimate of Section 3. The manuscript was written entirely by the authors, who take full responsibility for its mathematical content and correctness.
Acknowledgements. The second author is partially supported by the GNAMPA–INDAM Project 2026, ’Problemi di controllo e regolarità per evoluzione di insiemi’.
References
- [1]M. Alfaro, J. Brock, J. Foisy, N. Hodges, and J. Zimba, The standard double soap bubble in ℝ² uniquely minimizes perimeter. Pacific J. Math. 159 (1993), 47–59.
- [2]L. Ambrosio, A. Colesanti and E. Villa, Outer Minkowski content for some classes of closed sets. Mathematische Annalen 342 (2008), 727–748.DOI
- [3]L. Ambrosio, N. Fusco, and D. Pallara, Functions of Bounded Variation and Free Discontinuity Problems. Oxford University Press, 2000.
- [4]A. Bressan, Price offered for a dynamic blocking problem, available at https://bpb-us-e1.wpmucdn.com/sites.psu.edu/dist/c/168431/files/2023/07/prize2.pdf.
- [5]A. Barghi and P. Winkler, Firefighting on a random geometric graph, Random Struct. Algor. 46 (2015) 466–477.
- [6]S. Bianchini and M. Zizza, Existence of spiral strategies for blocking fire spreading. arXiv:2508.05324arxiv.org/abs/2508.05324
- [7]A. Bressan, Differential inclusions and the control of forest fires, J. Differential Equations (special volume in honor of A. Cellina and J. Yorke), 243 (2007), 179-207.
- [8]A. Bressan, M. Burago, A. Friend, and J. Jou, Blocking strategies for a fire control problem, Analysis and Applications 6 (2008), 229–246.DOI
- [9]A. Bressan and C. De Lellis, Existence of optimal strategies for a fire confinement problem, Comm. Pure Appl. Math. 62 (2009), 789–830.DOI
- [10]A. Bressan and T. Wang, Equivalent formulation and numerical analysis of a fire confinement problem, ESAIM; Control, Optim. Calc. Var. 16 (2010), 974–1001.DOI
- [11]A. Bressan and T. Wang, The minimum speed for a blocking problem on the half plane, J. Math. Anal. Appl., 356 (2009), 133–144.DOI
- [12]A. Bressan and T. Wang, Global optimality conditions for a dynamic blocking problem, ESAIM; Control, Optim. Calc. Var. 18 (2012), 124–156.
- [13]C. De Lellis and R. Robyr, Hamilton-Jacobi equations with obstacles, Arch. Ration. Mech. Anal. 200 (2011), 1051–1073.DOI
- [14]H. Federer, Geometric Measure Theory. Springer, Berlin, 1969.
- [15]R. Klein, E. Langetepe and C. Levcopoulos, A fire-fighter’s problem. In: Proceedings of the 31st International Symposium on Computational Geometry (SoCG 2015).
- [16]G. R. Lawlor, Double bubbles for immiscible fluids in ℝⁿ, J. Geom. Anal. 24 (2014), 190–204.
- [17]F. Maggi, Sets of Finite Perimeter and Geometric Variational Problems. Cambridge University Press, 2012.DOI
- [18]B. Reichardt, Proof of the double bubble conjecture in ℝⁿ. J. Geom. Anal. 18 (2008), 172–191.
- [19]J. Schmidt, A lower bound on the blob, preprint 2026, arXiv:2609.13313v1.arxiv.org/abs/2609.13313
- [20]T. Wang, Optimality conditions for a blocking strategy involving delaying arcs, J. Optim. Theory Appl. 152 (2012), 307–333.DOI



