Solution to a problem of guarding territory

DOI10.1016/0167-6911(86)90106-4MaRDI QIDQ1073723zbMATH OpenOpenAlexFDO

Authors Witold Rzymowski, Adam Stachura

Publication date 1986

Published in Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6911(86)90106-4

zbMATH Keywords

defenderinvaderplanar two-person gameproblem of guarding territorystrategies

Mathematics Subject Classification ID

2-person games (91A05) Differential games (aspects of game theory) (91A23)

Review text

There are two players on the plane: an invader I with maximal speed \(v>1\) and a defender D with maximal speed 1. It is shown that the disk of radius \(rv(v-1)^{-1}\) (where r denotes the destruction radius of the defender) is the domain of largest area which can be guarded by the defender.

Recommendations

• Guarding a line segment
• Guarding a line segment
• A problem of guarding line segment
• On the unsolvability of problems of guaranteed search in a sufficiently large domain
• scientific article; zbMATH DE number 1087215

Cited in

(5)

• Guarding a line segment
• A problem of guarding line segment
• Curves bounding maximal area
• Guarding a line segment
• Guarding a terrain by two watchtowers

This page was built for publication: Solution to a problem of guarding territory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1073723)