Hostname: page-component-89b8bd64d-5bvrz Total loading time: 0 Render date: 2026-05-12T07:56:45.890Z 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
Get access

Abstract

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

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable