logo
言語
ブックマーク
ログアウト

ジャーナル

論文検索サイト

アカウント

© 2022 Steel Science Portal

ヘルプ

詳細検索

論文検索サイト

site
site
site
site

システム/制御/情報 Vol. 11 (1998), No. 1

ISIJ International
belloff
オンライン版ISSN: 2185-811X
冊子版ISSN: 1342-5668
発行機関: THE INSTITUTE OF SYSTEMS, CONTROL AND INFORMATION ENGINEERS (ISCIE)

Backnumber

  1. Vol. 37 (2024)

    1. No.2
    2. No.1

  2. Vol. 36 (2023)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  3. Vol. 35 (2022)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  4. Vol. 34 (2021)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  5. Vol. 33 (2020)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  6. Vol. 32 (2019)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  7. Vol. 31 (2018)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  8. Vol. 30 (2017)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  9. Vol. 29 (2016)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  10. Vol. 28 (2015)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  11. Vol. 27 (2014)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  12. Vol. 26 (2013)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  13. Vol. 25 (2012)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  14. Vol. 24 (2011)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  15. Vol. 23 (2010)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  16. Vol. 22 (2009)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  17. Vol. 21 (2008)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  18. Vol. 20 (2007)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  19. Vol. 19 (2006)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  20. Vol. 18 (2005)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  21. Vol. 17 (2004)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  22. Vol. 16 (2003)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  23. Vol. 15 (2002)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  24. Vol. 14 (2001)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  25. Vol. 13 (2000)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  26. Vol. 12 (1999)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  27. Vol. 11 (1998)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  28. Vol. 10 (1997)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  29. Vol. 9 (1996)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  30. Vol. 8 (1995)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  31. Vol. 7 (1994)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  32. Vol. 6 (1993)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  33. Vol. 5 (1992)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  34. Vol. 4 (1991)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  35. Vol. 3 (1990)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  36. Vol. 2 (1989)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  37. Vol. 1 (1988)

    1. No.7
    2. No.6
    3. No.5
    4. No.4
    5. No.3
    6. No.2
    7. No.1

キーワードランキング

16 May. (Last 30 Days)

システム/制御/情報 Vol. 11 (1998), No. 1

一般化最小分散制御則に基づくセルフチューニングPID制御器の一設計

山本 透, 兼田 雅弘

pp. 1-9

DOI:

10.5687/iscie.11.1

抄録

Self-tuning control schemes need many control parameters corresponding to the order and the time-delay of the controlled object. Using such many control parameters yields the inferiority in the transient property. Therefore, in order to design practical self-tuning controllers, it is seemed that it is desirable to construct control systems with as few parameters as possible.
In this paper, we propose a method how to tune PID parameters adaptively, that is, a self-tuning PID control scheme, based on the relationship between a generalized minimum variance control (GMVC) law and a PID control law. Furthermore, we consider a design scheme of user-specified parameters included in the cost function of the GMVC. Finally, we apply the proposed scheme to an air pressure control system in order to investigate the effectiveness.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

一般化最小分散制御則に基づくセルフチューニングPID制御器の一設計

twitter
facebook
mendeley

Bibtex

Ris

倒立振子のモデル化と安定化のためのニューロPD制御

青山 武郎, 大松 繁, 岸田 芳幸

pp. 10-18

DOI:

10.5687/iscie.11.10

抄録

In Japan, about 84 percent of real plants adopt PID controllers. However, when we use them, we are required much effort and time for tuning the PID gains. In this paper, we propose a method using a neural network stabilization of the inverted pendulum which is the single input and two outputs system. Here, we propose a neuro-PD control system to stabilize the inverted pendulum, which consists of two PD controllers and a neural network to tune the PD gains. Finally, the experimental results to stabilize the inverted pendulum are illustrated to show effectiveness of the present method.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

倒立振子のモデル化と安定化のためのニューロPD制御

twitter
facebook
mendeley

Bibtex

Ris

行列不等式表現を用いた2自由度ロバストPIDコントローラの設計

河辺 徹, 田上 隆徳, 岡村 昌志

pp. 19-25

DOI:

10.5687/iscie.11.19

抄録

Generally, industrial processes are too complex to obtain precise dynamics of a plant. Therefore, a controller is required to have robustness property in that it can attain acceptable control performance and closed-loop stability in the presence of plant uncertainty. In this paper, we proposed the unified design method for robust PID controller with two degrees of freedom which satisfies multiple design specifications based on the matrix inequality approach. And we propose a new genetic algorithm for solving this matrix inequality problem, because this problem is not formulated as the linear matrix inequality problem. And this method demonstrated by numerical simulations and shows good performance.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

行列不等式表現を用いた2自由度ロバストPIDコントローラの設計

twitter
facebook
mendeley

Bibtex

Ris

複数のロバスト仕様をみたすPID制御器の設計

太田 有三, 李 静, 田川 聖治, 羽根田 博正

pp. 26-34

DOI:

10.5687/iscie.11.26

抄録

In this paper, a method to compute an almost correct region of PID parameters which guarantees robust stability and several robust performances for systems with real uncertain parameters is proposed. The proposed method can be compute the region in a short computing time by adopting the following idea and technique : The first one is the computational strategy to avoid the unnecessary small splitting of the parameter space of the PID controller. The second one is adopting the idea of computational geometry approach to reduce the time for executing the algorithm. The third one is to use the Non-convex Polygon Interval Arithmetic (NPIA) to compute the “good” estimate of value sets of transfer functions.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

複数のロバスト仕様をみたすPID制御器の設計

twitter
facebook
mendeley

Bibtex

Ris

H∞制御問題に対するPID制御器のパラメータ空間設計法

佐伯 正美, 木村 純壮, 倉田 洋行, 泰地 茂明

pp. 35-40

DOI:

10.5687/iscie.11.35

抄録

In this paper, a design method of a single-input single-output PID controller for H∞ control problem is proposed. Since the H∞ norm constraint consists of an internal stability condition and a frequency domain condition on the jω axis, the solution set of the PID gains for the H∞ control problem is given on a parameter plane as the intersection of the two sets which satisfy the above two conditions. As for the computation of the latter set, two methods are proposed. One is a method in which the set is directly computed from the frequency domain condition, and the other is a method in which the set is computed by using the parametrization of all the H∞ control solutions.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

H∞制御問題に対するPID制御器のパラメータ空間設計法

twitter
facebook
mendeley

Bibtex

Ris

開ループ周波数応答のオンライン同定と2自由度PID制御系の自動調整法

古谷 栄光, 荒木 光彦

pp. 41-49

DOI:

10.5687/iscie.11.41

抄録

In this paper, we study the accuracy of the open-loop frequency response of control system obtained by on-line identification from the closed-loop frequency response, and show that the open-loop frequency response required for design based on the frequency response can be obtained accurately. Moreover, we consider feedforward-type two-degree-of-freedom PID control systems, and propose an on-line design method of feedback controllers, and a design method of feedforward controllers focused on the number of phase-lead elements between the reference input and the manipulated input. Furthermore, combining these design methods, an on-line design method of two-degree-of-freedom PID control systems is proposed. The efficiency of the proposed design method is evaluated by simulation.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

開ループ周波数応答のオンライン同定と2自由度PID制御系の自動調整法

twitter
facebook
mendeley

Bibtex

Ris

論文アクセスランキング

16 May. (Last 30 Days)

この機能はログイン後に利用できます。
下のボタンをクリックしてください。

詳細検索

論文タイトル

著者

抄録

ジャーナル名

年

出版日を西暦で入力してください（4桁の数字）。

検索したいキーワードを入力して下さい