Hostname: page-component-74656f9884-rdgjk Total loading time: 0 Render date: 2026-11-09T03:03:24.781Z Has data issue: false hasContentIssue false

Global optimality conditions for a dynamic blockingproblem

Published online by Cambridge University Press:  23 December 2010

Alberto Bressan
Affiliation:
Department of Mathematics, Penn State University, University Park, Pa. 16802, USA. bressan@math.psu.edu; wangt@math.psu.edu
Tao Wang
Affiliation:
Department of Mathematics, Penn State University, University Park, Pa. 16802, USA. bressan@math.psu.edu; wangt@math.psu.edu

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The paper is concerned with a class of optimal blocking problems in the plane. Weconsider a time dependent set R(t) ⊂ ℝ2,described as the reachable set for a differential inclusion. To restrict its growth, abarrier Γ can be constructed, in real time. This is a one-dimensionalrectifiable set which blocks the trajectories of the differential inclusion. In this paperwe introduce a definition of “regular strategy”, based on a careful classification ofblocking arcs. Moreover, we derive local and global necessary conditions for an optimalstrategy, which minimizes the total value of the burned region plus the cost ofconstructing the barrier. We show that a Lagrange multiplier, corresponding to theconstraint on the construction speed, can be interpreted as the “instantaneous value oftime”. This value, which we compute by two separate formulas, remains constant when freearcs are constructed and is monotone decreasing otherwise.

Information

Type
Research Article
Copyright
© EDP Sciences, SMAI, 2010