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

ジャーナル

論文検索サイト

アカウント

© 2022 Steel Science Portal

ヘルプ

詳細検索

論文検索サイト

site
site
site
site

システム/制御/情報 Vol. 5 (1992), No. 10

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

キーワードランキング

03 Dec. (Last 30 Days)

システム/制御/情報 Vol. 5 (1992), No. 10

主成分回帰分析を用いる改良形GMDH

近藤 正

pp. 391-399

DOI:

10.5687/iscie.5.391

抄録

In this paper, a revised GMDH (Group Method of Data Handling) of multiinput-singleoutput type algorithm is developed by using principal component-regression analysis.
In previous GMDH algorithms, the optimal partial polynomials, which are generated by using the second degree polynomial of the two variables in each selection layer, are accumulated in multilayerd structure to construct the complete polynomial. But, in a high order selection layer, many combinations of two variables generate multicolinearity in partial polynomials and this presents a severe problem in estimation accuracy of model parameters. The nonlinear models which contain multicolinearity in the partial polynomials lack in stability and can not be used in prediction problems.
The revised GMDH in this paper generates some optimal partial polynomials which are identified by using principal component-regression analysis in each selection layer, and the complete description of the system is constructed by combining these optimal partial polynomials in multilayerd structure. The principal components which construct the partial polynomials are perendicular each other and so the partial polynomials generate no multicolinearity.
The revised GMDH algorithm is applied to a simple illustrative example and compared with the result obtained by the previous GMDH algorithm.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

主成分回帰分析を用いる改良形GMDH

twitter
facebook
mendeley

Bibtex

Ris

切換曲面を用いる最短時間制御の一応用

西村 行雄, 木村 純壮, 櫛田 直規, 米澤 洋

pp. 400-409

DOI:

10.5687/iscie.5.400

抄録

The authors have previously proposed a design method of time-optimal feedback control system by using switching hypersurface. In the present paper, the proposed method is applied to construct the control system of the training ship Ohshimamaru 330 GT, and then the practical applicability is shown in the sea trial.
The dynamics of a ship is presented by a complicated mathematical model with some nonlinear elements and dead time elements. To make the design of the dual mode controller tractable, the model of ship dynamics is simplified from the practical point of view. And dead time problem is evaded by making use of predictive control. In the simulated course changing control using the nonlinear mathematical model as a controlled object, it is confirmed that the time-optimal control is approximately realized, It is demonstrated that the proposed method is efective showing the resemblance of the results in the sea trial, with those in the simulation.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

切換曲面を用いる最短時間制御の一応用

twitter
facebook
mendeley

Bibtex

Ris

モデルベースド制御による空気圧駆動マニピュレータの位置決め制御

松浦 貞裕, 新谷 保之

pp. 410-417

DOI:

10.5687/iscie.5.410

抄録

Pneumatic drive systems have higher power/weight ratio. So, it is easy to make a compact and lightweight robot manipulator. On the other hand, it is very difficult to control this manipulator because of interference force between each axis and large friction which is caused by mechanical seal. Therefore, we applied model based control to a pneumatic drive manipulator, and we proposed the disturbance observer which used the concept of model based control. The effectiveness of the proposed control scheme is shown through experiments. Further more, we designed a compact robot manipulator using the link built-in rotary cylinder. As a result, we can state that we can use a pneumatic drive manipulator, which is very small and very light, as a industrial robot.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

モデルベースド制御による空気圧駆動マニピュレータの位置決め制御

twitter
facebook
mendeley

Bibtex

Ris

最適制御を用いた適応格子生成法

小早川 命, 山田 英太郎

pp. 418-426

DOI:

10.5687/iscie.5.418

抄録

As well known, computational fluid dynamics consists of two main parts, i. e. (1) generation of computational grid, and (2) numerical scheme to slove the conservation law. In this report, new methods for adaptive grid generation through the optimal regulator of digital control are presented. The performance index of linear optimal regulator problem has a strong relation to the characteristics of adaptive grid generation. Paying attention to this point, one and two dimensional Poisson equations are transformed into the state-space form. The numerical examples of NACA-0012 airfoil flow field show strong clustering of grid lines at shock waves through these two kinds of adaptation.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

最適制御を用いた適応格子生成法

twitter
facebook
mendeley

Bibtex

Ris

H∞制御によるホバークラフトの姿勢制御

大須賀 公一, 林 良太, 小野 敏郎

pp. 427-434

DOI:

10.5687/iscie.5.427

抄録

When a hovercraft is navigated, it is frequently heaved by some complex causes. However, most methods of decreasing the heave are only in the structural design of a vehicle.
In this paper we considered the application of H∞-control theory to designing the controllers which decreased the heave of hovercraft. To begin with the study, we made a simple model of a hovercraft which was restricted in two degrees of mechanical freedom (vertical motion and rotation) and made some configuration control experiments on it. As the result, we could show the effectiveness of our method.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

H∞制御によるホバークラフトの姿勢制御

twitter
facebook
mendeley

Bibtex

Ris

遺伝子のオペレータ表現とオペレータの進化を用いた遺伝アルゴリズム

岩本 貴司

pp. 435-437

DOI:

10.5687/iscie.5.435
mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

遺伝子のオペレータ表現とオペレータの進化を用いた遺伝アルゴリズム

twitter
facebook
mendeley

Bibtex

Ris

論文アクセスランキング

03 Dec. (Last 30 Days)

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

詳細検索

論文タイトル

著者

抄録

ジャーナル名

年

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

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