A game of optimal pursuit of one non-inertial object by two inertial objects (Q1086181): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On a certain convergence game / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4053412 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3331000 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5659370 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4145472 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Group pursuit under bounded evader coordinates / rank | |||
Normal rank |
Latest revision as of 17:58, 17 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A game of optimal pursuit of one non-inertial object by two inertial objects |
scientific article |
Statements
A game of optimal pursuit of one non-inertial object by two inertial objects (English)
0 references
1985
0 references
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.
0 references
one evader
0 references
two pursuers
0 references
fixed game duration
0 references
optimal solution
0 references
optimal pursuit strategies
0 references