Simple linear pursuit-evasion games (Q1095826): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0898-1221(87)90095-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2045582990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5532185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of linear evasion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on capture-avoidance games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Optimal Guidance for Homing Missiles / rank
 
Normal rank

Latest revision as of 13:41, 18 June 2024

scientific article
Language Label Description Also known as
English
Simple linear pursuit-evasion games
scientific article

    Statements

    Simple linear pursuit-evasion games (English)
    0 references
    0 references
    0 references
    0 references
    1987
    0 references
    A pursuit-evasion closed-loop qualitative game for a system \(\dot x=Ax+Bu+Cv\), \(u\in U\), \(v\in V\) (U and V are compacta) where \(\min_ u\max_ v\ell F(s)(Bu+Cv)\) (F(s) is the fundamental matrix) does not depend on \(\ell\), \(\| \ell \| =1\), and terminal set \(\{\) \(x: \| Dx\| \leq a\}\) is reduced to a family of games with terminal payoffs \(J=\| Dx(T)\|\). As an example, a solution of the isotropic rocket game is given.
    0 references
    0 references
    0 references
    0 references
    0 references
    pursuit-evasion closed-loop qualitative game
    0 references
    terminal payoffs
    0 references
    isotropic rocket game
    0 references
    0 references