(Q2) If the initial set Ω0 is not convex, what can one say about the optimal strategy?
Statement
(Q2) If the initial set Ω0 is not convex, what can one say about the optimal strategy? Under what conditions is it true that the sets Ω(t) are connected, for all t \in [0, T ] ? (Q3) More generally, all the above problems can be formulated on Rn , or even on an n-dimensional Riemann manifold. How much of the theory remains valid in a multidimensional setting? Does the convexity result stated in Theorem 1 remain true for optimal set motion in R3 ? The case with geographical constraints, where the pest population needs to be eradicated from an island (a bounded open set V in the plane), is also of interest. As before it is assumed that, within V , the contaminated region expands with unit speed in all directions, while the control can “clean up” an area M per unit time. In this setting, two main problems arise. Eradication problem. Find an admissible strategy t 7\to Ω(t) \subseteq V that completely eradicates the contamination in finite time. This means: Ω(0) = V , Ω(T ) = \varnothing, and the following constraint is satisfied: Z . E(t) = 1 + \beta(t, x) d\sigma \leq M for every t \in [0, T ]. \partialΩ(t)\capV
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.