A Lower Bound of the Degree of Stability for a Matrix Polytope and Its Applications-Discrete-Time Case
-
- KOKAME Hideki
- Department of Engineering, Osaka Institute of Technology
-
- KIDA Hiroshi
- Department of Engineering, Osaka Institute of Technology
-
- MORI Takehiro
- Department of Electronics and Information Science
Bibliographic Information
- Other Title
-
- 行列ポリトープの安定度下界とその応用-離散時間の場合
- ギョウレツ ポリトープ ノ アンテイド ゲカイ ト ソノ オウヨウ リサン ジ
Search this article
Description
The present paper is concerned with the robust stability of discrete-time plants when the characteristic matrix is known to be an element of a polytope of matrices. A lower bound of the degree of stability is presented which has a close parallelism to the continuous-time case. That is, the lower bound is expressed as the value of a two-person zero-sum game. Further the optimal solution provides a Lyapunov function common to all the elements of the polytope. Application to stability analysis of uncertain large-scale systems is discussed.
Journal
-
- Transactions of the Institute of Systems, Control and Information Engineers
-
Transactions of the Institute of Systems, Control and Information Engineers 5 (1), 18-23, 1992
THE INSTITUTE OF SYSTEMS, CONTROL AND INFORMATION ENGINEERS (ISCIE)
- Tweet
Details 詳細情報について
-
- CRID
- 1390282680142588032
-
- NII Article ID
- 10007399072
-
- NII Book ID
- AN1013280X
-
- ISSN
- 2185811X
- 13425668
-
- NDL BIB ID
- 3751279
-
- Data Source
-
- JaLC
- NDL
- Crossref
- CiNii Articles
-
- Abstract License Flag
- Disallowed