The lion and man problem - revisited (Q1060979): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 03:02, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The lion and man problem - revisited |
scientific article |
Statements
The lion and man problem - revisited (English)
0 references
1986
0 references
A pursuer P, whose speed is bounded by 1, wants to get closer to an evader E, whose speed is bounded by \(\omega >1\). P wants to reduce his distance PE from E below the capture radius \(\rho\). Both players are confined to a circular arena. This problem is equivalent to a problem discussed by \textit{J. Flynn} [SIAM J. Control 12, 581-597 (1974; Zbl 0289.90047)], who characterized and gave numerical bounds to the least upper bound \(d^*\) on the values of PE that E can maintain. He used direct methods and did not use Isaacs' theory. We solve our problem relying on the theory of singular surfaces in differential games. We construct and investigate barriers of the game of kind, and we replace Flynn's bounds on \(d^*\) by analytical (exact) values for various speeds \(\omega\).
0 references
singular surfaces
0 references
barriers of the game of kind
0 references
capture radius
0 references