On a Fire Fighter’s Problem

DOI10.1142/S0129054119500023zbMath1415.68255OpenAlexW2921202237MaRDI QIDQ5384460

Rolf Klein, Elmar Langetepe, Barbara Schwarzwald, Andrzej Lingas, Christos Levcopoulos

Publication date: 24 June 2019

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054119500023

zbMATH Keywords

upper boundlower boundmotion planningreachable setbarrierdynamic environmentsspiralling strategies

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Conformal mappings of special domains (30C20)

Related Items

A new model and algorithms in firefighting theory ⋮ Geometric firefighting in the half-plane ⋮ Approximation algorithms for the geometric firefighter and budget fence problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the optimal strategy for an isotropic blocking problem
• The minimum speed for a blocking problem on the half plane
• How many lions are needed to clear a grid?
• The firefighter problem for graphs of maximum degree three
• Differential inclusions and the control of forest fires
• Equivalent formulation and numerical analysis of a fire confinement problem
• Global optimality conditions for a dynamic blocking problem
• BLOCKING STRATEGIES FOR A FIRE CONTROL PROBLEM
• Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles
• Existence of optimal strategies for a fire confinement problem
• A Fire Fighter's Problem.
• Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem
• An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane
• Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems