Calculus of variations and optimal control; optimization Definition
Hamilton–Jacobi–Isaacs equation
Builds on Differential gameHamilton–Jacobi equationHamilton–Jacobi–Bellman equationViscosity solution
Definition
Let and be nonempty compact sets and let . Let , and be continuous. Consider the two-player zero-sum differential game with dynamics and payoff . The player with control minimises the payoff, and the player with control maximises it. The upper and lower Hamiltonians are, for , The Hamilton–Jacobi–Isaacs equations are the terminal value problems for an unknown function , one with and one with . The game satisfies Isaacs' condition if , and then the two equations coincide.
Remarks
Always . If has one point, both equal and the equation is the Hamilton–Jacobi–Bellman equation, a special Hamilton–Jacobi equation. Assume also that , and are bounded and Lipschitz in . Then the upper and lower values of the game, defined with nonanticipating strategies, are the viscosity solutions of these equations. Under Isaacs' condition the two values are equal, so the game has a value.
Example: if and , then the expression splits into a part that depends only on and a part that depends only on . So and are both the sum of of the first part and of the second, and Isaacs' condition holds.
Non-example: , , and . For , , so , while , so . Isaacs' condition fails, and the two equations are different.
Reading path
To understand this page from the ground up, read these 5 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Differential game concept
- Hamilton–Jacobi equation concept
- Hamilton–Jacobi–Bellman equation concept
- Viscosity solution concept
- Hamilton–Jacobi–Isaacs equation definition
Further reading
About this page
| Tag | Q5N7E7P6F6 |
|---|---|
| URI | m2://Q5N7E7P6F6 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 49L12, 49N70, 91A23 |
| Defines | Hamilton–Jacobi–Isaacs equation |
| Uses | Differential game, Hamilton–Jacobi equation, Hamilton–Jacobi–Bellman equation, Viscosity solution |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.