<p>The paper is concerned with a family of geometric evolution problems, modeling the spatial control of an invasive population within a region <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="32_2025_419_Article_IEq1.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="54" /> </InlineMediaObject> <EquationSource Format="TEX">\(V\subset {\mathbb R} ^2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>V</mi> <mo>⊂</mo> <msup> <mrow> <mi mathvariant="double-struck">R</mi> </mrow> <mn>2</mn> </msup> </mrow> </math></EquationSource> </InlineEquation> bounded by geographical barriers. If no control is applied, the contaminated set <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="32_2025_419_Article_IEq2.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="67" /> </InlineMediaObject> <EquationSource Format="TEX">\(\Omega (t)\subset V\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="normal">Ω</mi> <mo stretchy="false">(</mo> <mi>t</mi> <mo stretchy="false">)</mo> <mo>⊂</mo> <mi>V</mi> </mrow> </math></EquationSource> </InlineEquation> expands with unit speed in all directions. By implementing a control, a region of area <i>M</i> can be cleared up per unit time. Given an initial set <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="32_2025_419_Article_IEq3.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="109" /> </InlineMediaObject> <EquationSource Format="TEX">\(\Omega (0)=\Omega _0\subseteq V\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="normal">Ω</mi> <mrow> <mo stretchy="false">(</mo> <mn>0</mn> <mo stretchy="false">)</mo> </mrow> <mo>=</mo> <msub> <mi mathvariant="normal">Ω</mi> <mn>0</mn> </msub> <mo>⊆</mo> <mi>V</mi> </mrow> </math></EquationSource> </InlineEquation>, three main problems are studied: (1) existence of an admissible strategy <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="32_2025_419_Article_IEq4.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="64" /> </InlineMediaObject> <EquationSource Format="TEX">\(t\mapsto \Omega (t)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>t</mi> <mo>↦</mo> <mi mathvariant="normal">Ω</mi> <mo stretchy="false">(</mo> <mi>t</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> which eradicates the contamination in finite time, so that <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="32_2025_419_Article_IEq5.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="71" /> </InlineMediaObject> <EquationSource Format="TEX">\(\Omega (T)=\emptyset \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="normal">Ω</mi> <mo stretchy="false">(</mo> <mi>T</mi> <mo stretchy="false">)</mo> <mo>=</mo> <mi mathvariant="normal">∅</mi> </mrow> </math></EquationSource> </InlineEquation> for some <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="32_2025_419_Article_IEq6.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="45" /> </InlineMediaObject> <EquationSource Format="TEX">\(T&gt;0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>T</mi> <mo>&gt;</mo> <mn>0</mn> </mrow> </math></EquationSource> </InlineEquation>. (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,&#xa0;<i>T</i>]. For these optimization problems, a sufficient condition for optimality is proved, together with several necessary conditions. Based on these conditions, optimal set-valued motions <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="32_2025_419_Article_IEq4.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="64" /> </InlineMediaObject> <EquationSource Format="TEX">\(t\mapsto \Omega (t)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>t</mi> <mo>↦</mo> <mi mathvariant="normal">Ω</mi> <mo stretchy="false">(</mo> <mi>t</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> are explicitly constructed in a number of cases.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Optimally Controlled Moving Sets with Geographical Constraints

  • Alberto Bressan,
  • Elsa M. Marchini,
  • Vasile Staicu

摘要

The paper is concerned with a family of geometric evolution problems, modeling the spatial control of an invasive population within a region \(V\subset {\mathbb R} ^2\) V R 2 bounded by geographical barriers. If no control is applied, the contaminated set \(\Omega (t)\subset V\) Ω ( 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 \(\Omega (0)=\Omega _0\subseteq V\) Ω ( 0 ) = Ω 0 V , three main problems are studied: (1) existence of an admissible strategy \(t\mapsto \Omega (t)\) t Ω ( t ) which eradicates the contamination in finite time, so that \(\Omega (T)=\emptyset \) Ω ( T ) = for some \(T>0\) 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 \Omega (t)\) t Ω ( t ) are explicitly constructed in a number of cases.