A game of optimal pursuit of one non-inertial object by two inertial objects
type: Item
instance of: scholarly article
title: A game of optimal pursuit of one non-inertial object by two inertial objects
zbMATH Open document ID: 0607.90100
DOI: 10.1016/0021-8928(85)90045-0
author: A. Yu. Levchenkov
author: A. G. Pashkov
published in: Journal of Applied Mathematics and Mechanics
publication date: 1985-01-01T00:00:00Z
review text: A game in which one controlled object is pursued by two others is studied. The pursuing objects are inertial, and the pursued object is not. The duration of the game is fixed. The payoff functional is the distance between the pursued object and the closest pursuer at the instant when the game ends. An algorithm for determining the payoff function for all possible positions is constructed. It is shown that the game space consists of several domains in which the payoff is expressed analytically, or is determined by solving a certain non-linear equation. Strategies of the pursuers which guarantee them a result as close to the game payoof as desired are indicated.
Mathematics Subject Classification ID: 91A24
Mathematics Subject Classification ID: 91A23
Mathematics Subject Classification ID: 91A99
zbMATH DE Number: 3982954
zbMATH Keywords: one evader
zbMATH Keywords: two pursuers
zbMATH Keywords: fixed game duration
zbMATH Keywords: optimal solution
zbMATH Keywords: optimal pursuit strategies
MaRDI profile type: Publication
full work available at URL: 0021-8928(85)90045-0
OpenAlex ID: W2111244195
cites work: On a certain convergence game
cites work: Q4053412
cites work: Q3331000
cites work: Q5659370
cites work: Q4145472
cites work: Group pursuit under bounded evader coordinates
description: scientific article; zbMATH DE number 3982954