| Project/Area Number |
17360195
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (B)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Control engineering
|
|---|
| Research Institution | The University of Tokyo |
|---|
Principal Investigator |
HARA Shinji The University of Tokyo, Graduate School of Information Science and Technology, Professor (80134972)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
TSUCHIYA Takashi The Institure of Statistical Mathematics, Dept. of Mathematical Analysis and Statistical Inference, 教授 (00188575)
|
|---|
| Project Period (FY) |
2005 – 2007
|
| Project Status |
Completed (Fiscal Year 2007)
|
| Budget Amount *help |
¥8,950,000 (Direct Cost: ¥8,500,000、Indirect Cost: ¥450,000)
Fiscal Year 2007: ¥1,950,000 (Direct Cost: ¥1,500,000、Indirect Cost: ¥450,000)
Fiscal Year 2006: ¥2,100,000 (Direct Cost: ¥2,100,000)
Fiscal Year 2005: ¥4,900,000 (Direct Cost: ¥4,900,000)
|
|---|
| Keywords | Control system design / Robust control / Multi-objective control / KYP lemma / Frequency characteristics / Linear matrix inequality |
|---|
| Research Abstract |
The purpose of this research project is to develop a unified theory of control synthesis based on the analytical results on generalized KYP lemma, which is a finite frequency version of the original KYP lemma Especially, our main focus are on a systematic design method considering the more practical situations and on the design algorithms.
The results on the synthesis theory are as follows:
(1) PID controller synthesis based on the generalized KYP lemma.
(2) A time-domain interpretation of the generalized KYP lemma, which includes an equivalence of positive-realness in frequency-domain and passivity in time-domain as a special case. It is a first step of the investigation for nonlinear systems.
(3) An SoS (Sum of Squares) decomposition characterization of the generalized KYP lemma The result is useful for plant design from the view point of control.
(4) A dual characterization of the generalized KYP lemma and its computational complexity analysis.
A analysis/synthesis tool box has been developed based on our theoretical results. We also implemented primal-dual algorithms for solving the generalized KYP based optimization problems and compared the computational costs. The comparison shows that the positive semi-definite optimization problems derived from the generalized KYP lemma are very hard to solve in general. This motivates us to develop a new algorithm considering the structure.
|
