| Project/Area Number |
13650487
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Control engineering
|
|---|
| Research Institution | Kobe University |
|---|
Principal Investigator |
OHTA Yuzo Kobe University Faculty of Engineering, Professor, 工学部, 教授 (80111772)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
MASUBUCHI Izumi Hiroshima University, Graduate School of Engineering, Associate Professor, 大学院・工学研究科, 助教授 (90283150)
FUJISAKI Yasumasa Kbbe Universily, Faculty of Engineering, Associate Professor, 工学部, 助教授 (30238555)
|
|---|
| Project Period (FY) |
2001 – 2002
|
| Project Status |
Completed (Fiscal Year 2002)
|
| Budget Amount *help |
¥3,100,000 (Direct Cost: ¥3,100,000)
Fiscal Year 2002: ¥1,500,000 (Direct Cost: ¥1,500,000)
Fiscal Year 2001: ¥1,600,000 (Direct Cost: ¥1,600,000)
|
|---|
| Keywords | Computer Geometry / Piecewise Linear Lyapunov Function / Bilinear optimization Problem / Polytope Lyapunov Function / Switched Systems / Nonlinear Control / Robust Control / Bump-less Control / データ構造 / アルゴリズム / ハイブリッド制御 / 線形行列不等式 / 双線形問題 |
|---|
| Research Abstract |
The main results obtained through the research are summarized as follows.
1. Development of CAD system for robust controllers design of linear systems.
We developed a CAD system for robust controllers design of linear systems using value sets. For systems, which have completely decomposable, transfer functions and/or characteristic equations, the method using polygon interval arithmetic is very useful to compute value sets. We proposed and implemented a method computing value sets of multi-polynomial functions, which need not be completely decomposable.
2. Generation of piecewise linear Ly apunov functions.
We proposed a new class of piecewise linear Lyapunov functions (PLLFs) and derived stability results. A candidate of PLLF has parameters corresponding to hyperplanes intersecting stability region. The set of stability conditions are formulated as Linear Programming Problem (LP) in terms of parameters inserted by the hyperplanes. If the computed optimal value is negative, we construct a
… More
PWLLF using the solution. When the optimal value of the LP is nonnegative, we modify the PWLLF candidate by adding appropriate hyperplanes to introduce more freedom in the LP formulation and arrive at the desired result. The optimal value of the resulting new LP is always less than or equal to that of the old LP. We also proposed a scheme to generate hyperplanes such that the optimal value of the new LPs is less than that of the old LP. Moreover, we propose a fast method to compute the optimal solution of the new LP.
3. Data structure for Euclidean cell complex.
We proposed and implemented data structure for Euclidean cell complex. We used this data structure in programs for generation of PLLFs and will be used for controller design using PLLFs
4. Solution method of bilinear optimization problems.
The main issue in designing controllers using PLLFs is to solve bilinear optimization problems, which is non-convex problems, and, hence, it is not so easy to solve. But we believe that the problem rather easy to solve that bilinear matrix inequality problems. We proposed a method using Zoutendijk method. We implement this method, but further research is needed to improve convergence of the method. Less
|
