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

ジャーナル

論文検索サイト

アカウント

© 2022 Steel Science Portal

ヘルプ

詳細検索

論文検索サイト

site
site
site
site

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

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. 6 (1993), No. 5

ニューラルネットワークによる動的システムの推定と特性解析

山脇 重信, 藤野 政司, 今尾 勝三

pp. 207-212

DOI:

10.5687/iscie.6.207

抄録

This paper discusses the effectiveness of neural networks for modeling dynamic systems as follows. The neural network consists of the input, state and output layers. The state layer comprises unit delay feedback connections in order to enable the expression of dynamic systems. In the first approach, the neural network is used to implement the external description model for a class of dynamic systems. It is shown that the neural network gives better estimation results and compares favorably with a linear regression model. In the second approach, as internal description models, linear and bilinear models are obtained by using the previously estimated results. That is, these models can be calculated by using the first and second approximations of sigmoid functions at threshold, according to Taylor's formula. Further, reduced-order realizations for each model are executed by using internally balanced realization methods, by which the singular values of reachability and observability matrices are given equally. Finally, some numerical examples are presented to illustrate the proposed methods.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

ニューラルネットワークによる動的システムの推定と特性解析

twitter
facebook
mendeley

Bibtex

Ris

ニューラルネットワークを用いたロボットマニピュレータの手先位置・姿勢誤差の補償

黒川 圭一, 渡部 透, 得丸 英勝, 川野 亨, 久保 誠吾, 山川 恵嗣, 河田 健一

pp. 213-222

DOI:

10.5687/iscie.6.213

抄録

A method using neural-networks to compensate for errors in the position and orientation of robot manipulators is proposed. The errors of robot manipulators due to miss in setting or modeling are measured and learned by a neural network. The reference input to robot controllers is modified by using the neural network. The compensation algorithm is discussed in the paper. A method to add the second neural network to the first one is also proposed in order to obtain the accuracy of the compensation without the much increase of the learning time in the back-propagation process. The proposed compensation method is investigated by computer simulation for a two-link and a six-link manipulator, and the method is compared with the one using linear interpolation. It is verified that the errors in the robot manipulators are significantly reduced by using the proposed compensation method. The method is also applied to a two-link SCARA type D.D. robot and its effectiveness is verified by experiments.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

ニューラルネットワークを用いたロボットマニピュレータの手先位置・姿勢誤差の補償

twitter
facebook
mendeley

Bibtex

Ris

非線形システムの同定を目的としたニューラルネットワークによる加熱炉ヒートパターンの同定

近藤 正

pp. 223-231

DOI:

10.5687/iscie.6.223

抄録

Identification problem of furnace heat patterns by using a neural network is described. The neural network used in this paper can identify a nonlinear system whose structure is very large and complex. For the application to practical identification problems, it is necessary to construct a neural network which is very accurate and effective for practical use. In this paper, by using a prediction error for new data which are not used for learning, a suitable neural network structure and a suitable number of learning are found out, and a neural network which is very effective for identification of furnace heat patterns is constructed. The prediction results obtained by using the neural network is compared with the results obtained by using GMDH (Group Method of Data Handling) models. It is shown that the neural network in this paper gives better prediction results as compared with GMDH models.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

非線形システムの同定を目的としたニューラルネットワークによる加熱炉ヒートパターンの同定

twitter
facebook
mendeley

Bibtex

Ris

屋外用視覚誘導方式を用いた無人搬送車の誘導走行

牧野 俊昭, 橋本 直人

pp. 233-242

DOI:

10.5687/iscie.6.233

抄録

In this paper, an outdoor type visual guidance system by using an image recognition method is proposed for an outdoor AGV to travel stably. The outdoor type visual guidance system uses a ITV camera in order to obtain reflective images of three typed guiding marks adhered to the traveling line surface which is illuminated by a natrium light. The camera with the high speed shutter device is able to obtain a visual image in 1ms. Factors which affect detecting image characteristics are examined through the computer simulation. Traveling information can be detected within from 20ms to 50ms recognition time.
In outdoor traveling experiment, the developed outdoor AGV was verified to travel smoothly on a straight line at 60m/min with as little as±25mm amplitude deviation which is less than the guiding marks width and with 10sec. period hunting motion.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

屋外用視覚誘導方式を用いた無人搬送車の誘導走行

twitter
facebook
mendeley

Bibtex

Ris

区間目的関数をもつ線形計画問題における最悪達成率最適化

乾口 雅弘, 村田 晋一, 坂和 正敏

pp. 243-251

DOI:

10.5687/iscie.6.243

抄録

In this paper, a new solution concept for linear programming problem with an interval objective function is proposed based on the worst achievement rate. First, given coefficients of the objective function, the achievement rate for each feasible solution is defined. Using the achievement rate, the interval linear programming problem is formulated as an optimization problem of the worst achivement rate among the objective coefficients within given intervals. The optimization problem of the worst achievement rate is reduced to a min-max or max-min problem subject to separate constraints. It is shown that the solution optimizing the worst achievement rate has a desirable property. A solution algorithm based on the relaxation procedure and the simplex method is proposed to solve the optimization problem of the worst achievement rate. In order to illustrate the proposed solution algorithm, a numerical example is given.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

区間目的関数をもつ線形計画問題における最悪達成率最適化

twitter
facebook
mendeley

Bibtex

Ris

論文アクセスランキング

03 Dec. (Last 30 Days)

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

詳細検索

論文タイトル

著者

抄録

ジャーナル名

年

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

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