The cubic algorithm for global games with application to pursuit-evasion games (Q1311987)
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: The cubic algorithm for global games with application to pursuit-evasion games |
scientific article; zbMATH DE number 487975
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The cubic algorithm for global games with application to pursuit-evasion games |
scientific article; zbMATH DE number 487975 |
Statements
The cubic algorithm for global games with application to pursuit-evasion games (English)
0 references
19 January 1994
0 references
A new algorithm for finding the global minmax or maxmin of a Lipschitz continuous function defined over a cube are presented. Applications to game theory (static and differential games) are discussed. A numerical procedure via the cubic algorithm is constructed to solve an illustrating example of a ship-torpedo collision-avoidance differential game with manoeuvrability constraints.
0 references
Lipschitz continuous function
0 references
collision-avoidance
0 references
manoeuvrability constraints
0 references
