Volume 18, Number 1, January-March 2012
|Page(s)||124 - 156|
|Published online||23 December 2010|
Global optimality conditions for a dynamic blocking problem
Department of Mathematics, Penn State University,
University Park, Pa.
The paper is concerned with a class of optimal blocking problems in the plane. We consider a time dependent set R(t) ⊂ ℝ2, described as the reachable set for a differential inclusion. To restrict its growth, a barrier Γ can be constructed, in real time. This is a one-dimensional rectifiable set which blocks the trajectories of the differential inclusion. In this paper we introduce a definition of “regular strategy”, based on a careful classification of blocking arcs. Moreover, we derive local and global necessary conditions for an optimal strategy, which minimizes the total value of the burned region plus the cost of constructing the barrier. We show that a Lagrange multiplier, corresponding to the constraint on the construction speed, can be interpreted as the “instantaneous value of time”. This value, which we compute by two separate formulas, remains constant when free arcs are constructed and is monotone decreasing otherwise.
Mathematics Subject Classification: 49J24 / 49K24
Key words: Dynamic blocking problem / optimality conditions / differential inclusion with obstacles
© EDP Sciences, SMAI, 2010
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.