A certain evasion problem (Q762083)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A certain evasion problem |
scientific article; zbMATH DE number 3887486
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A certain evasion problem |
scientific article; zbMATH DE number 3887486 |
Statements
A certain evasion problem (English)
0 references
1984
0 references
One solves the differential game, in a plane, of a pursuer against two targets, in which the pursuer minimizes the time up to the R-collision with one of the targets while the coordinated action of the targets maximizes the minimal distance between the pursuer and the second target.
0 references
one pursuer
0 references
two coordinated evading targets
0 references
R-collision
0 references
0.8845589756965637
0 references
0.8559565544128418
0 references
