Multi-time scale zero-sum differential games with perfect state measurements (Q1345450): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Dynamic noncooperative game theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(H^ \infty\) - optimal control and related minimax design problems. A dynamic game approach / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(H^ \infty\)-optimal control for singularly perturbed systems. I: Perfect state measurements / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A decomposition of near-optimum regulators for systems with slow and fast modes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4309840 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multiparameter singular perturbations of linear systems with multiple time scales / rank | |||
Normal rank |
Revision as of 11:13, 23 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Multi-time scale zero-sum differential games with perfect state measurements |
scientific article |
Statements
Multi-time scale zero-sum differential games with perfect state measurements (English)
0 references
30 January 1996
0 references
The paper is devoted to three multi-time scale zero-sum differential games. Its open-loop dynamics are described by a singularly perturbed differential equation which depends on two small positive parameters \(\varepsilon_1\), \(\varepsilon_2\). Given a quadratic cost functional, to be minimized the Player 1 and maximized by Player 2, for each fixed \(\varepsilon_1\), \(\varepsilon_2\) the well-known approach based on a generalized Riccati equation can be used. However, its realization for small values of the above parameters is prone to numerical errors and inaccuracies. The notion of ``approximate saddle- point solution'' is used in the paper to refer to strategies that do not depend on \(\varepsilon_1\) and \(\varepsilon_2\), while providing cost levels within \(O(\varepsilon_1)\) of the full-order game. Necessary and sufficient conditions for the existence of such ``approximate'' solutions are obtained. It is shown that the original game can be decomposed into three subgames -- slow, fast and fastest -- the composite solution of which make up the approximate saddle-point solution of the original game.
0 references
approximate saddle-point solution
0 references
multi-time scale zero-sum differential games
0 references
0 references
0 references