Avoidance of many pursuers in the simple motion case (Q1068738): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3887272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3858076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On ''the game of \(1+n\) cars'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of evading many pursuers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3965941 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3670945 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0022-247x(85)90233-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2045223246 / rank
 
Normal rank

Latest revision as of 11:02, 30 July 2024

scientific article
Language Label Description Also known as
English
Avoidance of many pursuers in the simple motion case
scientific article

    Statements

    Avoidance of many pursuers in the simple motion case (English)
    0 references
    0 references
    0 references
    1985
    0 references
    We present a sufficient condition for the existence of an evasion strategy in a game with n pursuers in the plane, when the simple motion case is considered. The method used in the article is analogous to a previous one of the second author [ibid. 99, 109-122 (1984; Zbl 0556.90106)]. Nevertheless, our assumptions (other game, different sets of controls for different pursuers) require in some places completely different treatment.
    0 references
    many pursuers
    0 references
    planar game
    0 references
    sufficient condition
    0 references
    existence of an evasion strategy
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers