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

ジャーナル

論文検索サイト

アカウント

© 2022 Steel Science Portal

ヘルプ

詳細検索

論文検索サイト

site
site
site
site

システム/制御/情報 Vol. 4 (1991), No. 8

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.8
    2. No.7
    3. No.6
    4. No.5
    5. No.4
    6. No.3
    7. No.2
    8. 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

キーワードランキング

21 Nov. (Last 30 Days)

システム/制御/情報 Vol. 4 (1991), No. 8

外乱の影響を軽減するディジタル型MRACSの一設計法

米澤 洋, 西村 行雄, 陳 曙銘

pp. 305-311

DOI:

10.5687/iscie.4.305

抄録

In this paper, a design method of MRACS (Model Reference Adaptive Control System) is propose& for continuous time plants in the presence of slowly-varying disturbance, by which it is possible to make the output error arbitrarily small. Considered that the control law of MRACS is easy to be realized by digital controller, the structure of this paper is composed as follows : First, the continuous time system is transformed to discrete time system by using sampler and zero-order holder, where the effect of disturbance on the plant output is described by a convolution integral.
Next, in order to reduce the effect of disturbance, an integral precompensator is introduced to the sampled system, and an adaptive adjustment law with dead-zone is utilized. as analyzed theoretically, for any reference signals this reaches the results that if a small sampling period is chosen, the influence of disturbance on output can be controlled small.
Finally, that the control system is stable and that the signals of the system are bounded are proved. The effectiveness of the proposed method is illustrated by computer simulations.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

外乱の影響を軽減するディジタル型MRACSの一設計法

twitter
facebook
mendeley

Bibtex

Ris

二足歩行ロボットの学習形軌道生成

呉松 保男, 岩田 雅史, 北村 新三

pp. 312-319

DOI:

10.5687/iscie.4.312

抄録

A hierarchical structure for motion planning and learning control of a biped locomotive robot is introduced. At the upper level of the system, the motion of the center of gravity of the robot is simulated by that of an inverted pendulum. This enables us to compute and predict the position of the center of gravity and also the landing position of supporting toe for next steps. In the second level, in order to determine the positions of other joints from the position of the center of gravity, and of the two toes, we have used an approach known as Hopfield model. However, the inverted pendulum model proposed does not exactly reflect on the actual movement of the robot and there may be some errors in the scheme of neurocomputing. To cope with such situations, the reference input for the position of the center of gravity of the robot is compensated by a learning function of a multi-layered neural network. The system provides an autonomous motion planning scheme for the biped locomotive robots, which is able to cope with, to some extent, the change of walking pattern. Simulation results showed the effectiveness of the proposed method.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

二足歩行ロボットの学習形軌道生成

twitter
facebook
mendeley

Bibtex

Ris

プラント制御用エキスパートシェルERICの推論処理手法

石岡 卓也, 竹垣 盛一, 大井 忠

pp. 320-330

DOI:

10.5687/iscie.4.320

抄録

To apply knowledge-based methods to industrial process control systems, we developed a real-time expert shell : ERIC (Extended Rule-based system for Intelligent Control).
Its knowledge-base consists of working memory and rule-base. To present a process structure in working memory, we support a link description in frame-type data. The rule-base has a module structure of rule sets. Each rule set is a group of boolian or fuzzy logic rules. Therefore, the rule-base can express plant operation in various situations totally.
In this paper, we present the structure of internal data for knowledge-base in ERIC. And we explain an integrated inference procedure for boolian logic rules and fuzzy logic rules based on the structure of internal data.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

プラント制御用エキスパートシェルERICの推論処理手法

twitter
facebook
mendeley

Bibtex

Ris

アダプティブフィードフォワード制御を用いた速度および位置制御システム

鎌野 琢也, 鈴木 茂行, 井内 則久, 富塚 誠義

pp. 331-338

DOI:

10.5687/iscie.4.331

抄録

This paper considers the use of an adaptive feedforward controller for both a speed control system and a positioning system with a DC servo motor. The parameters of the feedforward controller are adjusted by an adaptation algorithm, the objective of which is to make the feedforward controller a dynamic inverse of the plant. Moreover, an adaptive disturbance compensator is used, and its parameter is adjusted by the algorithm. The error between the desired output and actual output is used as the adaptation error signal as well as the input to the nonadaptive feedback controller. After the adaptive process is completed, the input to the motor is no longer supplied by the feedback controller but by the feedforward controller. The stability of the proposed adaptive control systems is analyzed and experimentally verified.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

アダプティブフィードフォワード制御を用いた速度および位置制御システム

twitter
facebook
mendeley

Bibtex

Ris

多段圧延機の多変数形状制御

能勢 和夫, 前田 恭志, 下村 雅一, 坪野 肇

pp. 339-346

DOI:

10.5687/iscie.4.339

抄録

This paper describes a multivariable algorithm for controlling the flatness of a multi-high rolling mill with actuators of crown control, lateral shift, and tilting rolling. First, the flatness control problem is formulated as a Linear-Quadratic control problem and the control law is derived. Second, to ensure the control constraints are satisfied, a practical flatness control algorithm is proposed. A non-interactive control algorithm is also proposed to compensate for the thickness disturbance caused by the flatness control. Finally, field test results are presented showing the performance of the proposed control algorithms.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

多段圧延機の多変数形状制御

twitter
facebook
mendeley

Bibtex

Ris

論文アクセスランキング

21 Nov. (Last 30 Days)

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

詳細検索

論文タイトル

著者

抄録

ジャーナル名

年

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

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