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

ジャーナル

論文検索サイト

アカウント

© 2022 Steel Science Portal

ヘルプ

詳細検索

論文検索サイト

site
site
site
site

システム/制御/情報 Vol. 7 (1994), No. 12

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

キーワードランキング

27 Dec. (Last 30 Days)

システム/制御/情報 Vol. 7 (1994), No. 12

ニューラルネットワークを利用した適応型エレベータ群管理システム

喜多 一, 西川 〓一, Yoshikazu NISHIKAWA

pp. 487-497

DOI:

10.5687/iscie.7.487

抄録

The control of a group of elevators is a difficult stochastic control problem, because of the random and unpredictable passenger arrivals. Here we propose a new method for constructing an adaptive controller for stochastic systems, by using a combination of neural networks and an on-line reinforcement learning based on stochastic approximation. This method combines an efficient supervised learning with a general reinforcement adaptation. The supervised learning is used to prepare the controller with domain-specific knowledge, and for initializing it to emulate an existing controller. The reinforcement learning is used for adaptation, with a special attention paid to allow online operation. The new method is used to develop an adaptive, optimal elevator group controller. Results of simulation tests indicate the feasibility of using the proposed method for industrial applications.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

ニューラルネットワークを利用した適応型エレベータ群管理システム

twitter
facebook
mendeley

Bibtex

Ris

連想能力を改善するニュ-ラルネットワ-クの拡張構成

大西 竜太, 藤崎 泰正, 平井 一正

pp. 498-504

DOI:

10.5687/iscie.7.498

抄録

In this paper, we propose an expanding construction of neural networks to improve associative ability when we use the projection rule to memorize prototype vectors in the networks. In order to embed the prototype vectors in the high order networks, we add an arbitrary fixed pattern to each prototype vector at the memorizing process and add it to each key vector at the recalling process. The associative ability is concerned with the domain of attraction of each equilibrium corresponding to each prototype vector. We evaluate the domain of attraction of the networks and prove that the domain of attraction of the expanded networks is larger than that of the non-expanded networks. The evaluation of the domain of attraction depends only on the order of added pattern. The simulation results show the quantitative relations between the order of the networks and the domain of attraction.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

連想能力を改善するニュ-ラルネットワ-クの拡張構成

twitter
facebook
mendeley

Bibtex

Ris

ロボットの動的制御における計算の並列化アルゴリズムとオブジェクト指向による実現

田川 聖治, 神吉 良英, 太田 有三, 羽根田 博正

pp. 505-511

DOI:

10.5687/iscie.7.505

抄録

A parallel processing scheme is described for dynamic control computation of a robot-arm on any number of parallel processors. The control law for dynamic control of the robot-arm is generally represented by the sum of products. Such a control law usually consists of a huge number of operations. However, some of these operations are redundant and may be reduced by factorization. This paper proposes a practical scheduling algorithm which assigns the operations of the control law to parallel processors considering how many of them could be reduced by factorization.
Based on the proposed algorithm, a scheduling system is also developed by using an object oriented approach (g++). Then, a wonderful effect of the proposed algorithm is demonstrated through examples.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

ロボットの動的制御における計算の並列化アルゴリズムとオブジェクト指向による実現

twitter
facebook
mendeley

Bibtex

Ris

時変プラントにロバストな可変構造型MRACS

田中 幹也, 清水 顯

pp. 512-519

DOI:

10.5687/iscie.7.512

抄録

This paper proposes a design scheme of variable structure (VS) type model reference adaptive control systems (MRACS) which is robust to a plant with time-variable parameters. In this design scheme, the influence of time-variable parameters is regarded as a disturbance to a nominal model of the plant and is eliminated by using a VS method. Furthermore, parameters of a controller are also adjusted by using the VS method.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

時変プラントにロバストな可変構造型MRACS

twitter
facebook
mendeley

Bibtex

Ris

2ディスク型混合感度問題の最適PID制御器の設計法

佐伯 正美

pp. 520-527

DOI:

10.5687/iscie.7.520

抄録

A design method of PID controller for a two disk type mixed sensitivity problem is proposed. Permissible sets of PID gains which satisfy constraints on the sensitivity and complementary sensitivity functions are obtained at each frequency and a solution can be obtained as the intersection of these parameter sets and an optimal solution can be obtained by this method. The datum necessary for the design is the frequency response of the plant and no mathematical model is necessary. The algorithm is simple and easy for programming. A few numerical examples are given.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

2ディスク型混合感度問題の最適PID制御器の設計法

twitter
facebook
mendeley

Bibtex

Ris

ニューラルネットの構造決定における遺伝的アルゴリズムの応用

田中 雅博, 古賀 久司, 谷野 哲三

pp. 528-530

DOI:

10.5687/iscie.7.528
mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

ニューラルネットの構造決定における遺伝的アルゴリズムの応用

twitter
facebook
mendeley

Bibtex

Ris

論文アクセスランキング

27 Dec. (Last 30 Days)

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

詳細検索

論文タイトル

著者

抄録

ジャーナル名

年

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

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