Differential game of optimal approach of two inertial pursuers to a noninertial evader (Q1123147): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q908868
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: A. Yu. Levchenkov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3331000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: DIFFERENTIAL GAMES. APPROXIMATION AND FORMAL MODELS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3890468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A differential game with two pursuers and one evader / rank
 
Normal rank
Property / cites work
 
Property / cites work: A differential game of approach with two pursuers and one evader / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a certain convergence game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalization of the main equation of differential game theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point-capture of two evaders in succession / rank
 
Normal rank

Latest revision as of 09:00, 20 June 2024

scientific article
Language Label Description Also known as
English
Differential game of optimal approach of two inertial pursuers to a noninertial evader
scientific article

    Statements

    Differential game of optimal approach of two inertial pursuers to a noninertial evader (English)
    0 references
    0 references
    0 references
    1990
    0 references
    The game of the optimal approach of two identical inertial pursuers to a noninertial evader is investigated. The duration of the game is fixed. The payoff functional is the distance between the evader and the closest pursuer when the game terminates. The value function is constructed for all possible positions of the game. The regions where the pursuit is one- to-one and the regions where it is essentially collective are described algorithmically. Some analogies between this game and the linear differential game with elliptical vectograms are indicated. It is noted that the focal surface and the dispersal surface are in the proximity of one another.
    0 references
    programmed maximin function
    0 references
    one evader
    0 references
    optimal approach
    0 references
    two identical inertial pursuers
    0 references
    value function
    0 references
    focal surface
    0 references
    dispersal surface
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references