Optimally Controlled Moving Sets with Geographical Constraints
Abstract
The paper is concerned with a family of geometric evolution problems, modeling the spatial control of an invasive population within a region V⊂ 2 bounded by geographical barriers. If no control is applied, the contaminated set (t)⊂ 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⊂eq V, three main problems are studied: (1) Existence of an admissible strategy t(t) which eradicates the contamination in finite time, so that (T)= 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 (t) are explicitly constructed in a number of cases. abstract
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.