A dynamic programming approach to the fire blocking problem
From MaRDI portal
Cites work
- An elliptical growth model of forest fire fronts and its numerical solution
- An equivalence theorem on minimum sheltering speed for non-convex habitats
- BLOCKING STRATEGIES FOR A FIRE CONTROL PROBLEM
- Differential inclusions and the control of forest fires
- Dynamic sheltering problem and an existence theorem for admissible strategies
- Equivalent formulation and numerical analysis of a fire confinement problem
- Existence of optimal strategies for a fire confinement problem
- Geometric firefighting in the half-plane
- Global optimality conditions for a dynamic blocking problem
- Hamilton-Jacobi equations with obstacles
- scientific article; zbMATH DE number 3855514 (Why is no real title available?)
- scientific article; zbMATH DE number 3505708 (Why is no real title available?)
- scientific article; zbMATH DE number 1448982 (Why is no real title available?)
- Introduction to the mathematical theory of control
- On the optimal strategy for an isotropic blocking problem
- On the regularity of optimal dynamic blocking strategies
- Optimal control
- Optimal control and viscosity solutions of Hamilton-Jacobi-Bellman equations
- Optimality conditions for a blocking strategy involving delaying ARCS
- Sets of finite perimeter and geometric variational problems. An introduction to geometric measure theory
- Sufficient Conditions for Optimality and the Justification of the Dynamic Programming Method
- The minimum speed for a blocking problem on the half plane
This page was built for publication: A dynamic programming approach to the fire blocking problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7295762)
