Optimally Controlled Moving Sets with Geographical Constraints
Alberto Bressan, Elsa M. Marchini, Vasile Staicu
TL;DR
We study optimally controlled moving sets confined to a geographic region $V$, modeling eradiation of an invasive population with perimeter-based control costs and unit-speed natural growth. The authors develop a BV-based weak framework to formulate the Eradication, Minimum Time, and Optimization problems under geographic constraints, proving existence of solutions and deriving Pontryagin-type necessary conditions via needle perturbations and an adjoint variable $Y$. They establish a sufficient condition for optimality, and provide a detailed program to construct optimal set motions in various geometric settings, including symmetric and non-symmetric domains, discs, corners, and polygonal islands, often reducing the boundary dynamics to combinations of free arcs and circumferential controlled arcs with constant curvature. The work yields explicit, Dido-type optimal structures in several cases and presents local existence results for maximal free arcs, offering guidelines for explicit computation of optimal strategies in constrained environments and highlighting key open questions about regularity and global constructions.
Abstract
The paper is concerned with a family of geometric evolution problems, modeling the spatial control of an invasive population within a region $V\subset \R^2$ bounded by geographical barriers. If no control is applied, the contaminated set $Ω(t)\subset V$ expands with unit speed in all directions. By implementing a control, a region of area $M$ can be cleared up per unit time. Given an initial set $Ω(0)=Ω_0\subseteq V$, three main problems are studied: (1) Existence of an admissible strategy $t\mapstoΩ(t)$ which eradicates the contamination in finite time, so that $Ω(T)=\emptyset$ for some $T>0$. (2) Optimal strategies that achieve eradication in minimum time. (3) Strategies that minimize the average area of the contaminated set on a given time interval $[0,T]$. For these optimization problems, a sufficient condition for optimality is proved, together with several necessary conditions. Based on these conditions, optimal set-valued motions $t\mapsto Ω(t)$ are explicitly constructed in a number of cases. \end{abstract}
