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

ジャーナル

論文検索サイト

アカウント

© 2022 Steel Science Portal

ヘルプ

詳細検索

論文検索サイト

site
site
site
site

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

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. 20 (2007), No. 6

ビヘイビアアプローチに基づく離散時間最小二乗規範型推定について

金子 修, 藤井 隆雄

pp. 227-237

DOI:

10.5687/iscie.20.227

抄録

This paper addresses discrete-time least-squares estimation in a behavioral framework. Firstly, we formulate the problem we attack here in a behavioral setting. Next, we provide some new results on polynomial matrices, spectral factorizations and dissipation theory. By using these new results, we then give a necessary and sufficient condition for a latent variable to yield the optimal estimation of the measured signal with observations on the theoretical differences between the discrete-and the continuous-time case. Then, we discuss issues on the implementation of the optimal estimator and we give a real-time algorithm so as to obtain the optimal estimation on-line. In order to show the validity of the results, we also give a simple numerical example.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

ビヘイビアアプローチに基づく離散時間最小二乗規範型推定について

twitter
facebook
mendeley

Bibtex

Ris

l2性能保証領域に基づく飽和を有する離散時間ロバスト制御系の切替制御と実験的検証

長谷川 貴紀, 木山 健, 竹川 正浩

pp. 238-247

DOI:

10.5687/iscie.20.238

抄録

This paper considers methods for regional robust l2 performance analysis and its state feedback control synthesis of linear time invariant discrete-time systems with saturation nonlinearities via a polytopic approach for the nonlinearities. For the analysis and synthesis, a domain of l2 performance is defined as a domain of initial states guaranteed with l2 performance and exponential stability one. The solvability conditions of the analysis and synthesis problem based on the domain can be recasted as linear matrix inequalities via level sets of quadratic Lyapunov functions, the polytopic approach and constant scaling matrices for the robustness. However, the single state feedback gain without switching cannot achieve non-conservative control performance due to evaluating an admissible set of the exogenous inputs to be large. Specifically, when the exogenous input, the state and the performance output are measurable such as a tracking control problem for servo control systems, this paper proposes a switching control of the state feedback gains designed by the derived synthesis conditions using off-line computation in order to reduce conservativeness of the results without the switching. Finally, this paper verifies effectiveness of our proposed switching control method through a simulation and an experiment.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

l2性能保証領域に基づく飽和を有する離散時間ロバスト制御系の切替制御と実験的検証

twitter
facebook
mendeley

Bibtex

Ris

グラフ電卓を利用した制御系解析・設計用ライブラリ

川谷 亮治, 高田 直人

pp. 248-254

DOI:

10.5687/iscie.20.248

抄録

The graphing calculator, Voyage200, is a calculator which has the Derive system as a computational engine and can do symbolic manipulation. It has a large liquid crystal display (128 × 240 pixels) as for a calculator and various responses can be drawn on it. Furthermore, it can be easy to make user-defined functions on it and extend to solve specified problems. Taking notice of the high potential and its portability, we develop the library for analysis and synthesis of linear control systems. In this paper, we introduce typical programs including our library which consists of programs more than 100 and examine the effectiveness at the stand point of control education. According to the results of several examples, our system may be available for the 4th order systems or less, as regards computational time. However, it must be enough as education of the beginners of control engineering and powerful handheld tool.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

グラフ電卓を利用した制御系解析・設計用ライブラリ

twitter
facebook
mendeley

Bibtex

Ris

プロジェクトのためのダミーとその必要量に関する一考察

諏訪 晴彦, 三道 弘明

pp. 255-261

DOI:

10.5687/iscie.20.255

抄録

The present study considers a new slack-based strategy for project scheduling, which introduces dummies. A dummy corresponds to an unforced slack time and is used for absorption of schedule delays caused by disturbances during the schedule execution. In this paper, we propose a mathematical model for determining an optimal dummy size K* to be inserted into a baseline schedule of a given project, considering the costs for dummies as well as those for schedule delays caused by disturbances. We first describe the concept of dummy and then formulate the total expected cost of a schedule with dummies. Clarified are the conditions on which a unique finite optimal dummy size K* exists, where the total expected cost is minimized. We also discuss the characteristics and the effectiveness of the proposed model through some numerical examples.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

プロジェクトのためのダミーとその必要量に関する一考察

twitter
facebook
mendeley

Bibtex

Ris

不確かな線形システムに対する厳密なロバストH2性能解析

福本 寛子, 藤崎 泰正

pp. 262-267

DOI:

10.5687/iscie.20.262

抄録

Exact robust H2 performance analysis is considered for linear time-invariant systems whose coefficient matrices are polynomials of a single parameter. A necessary and sufficient condition for the robust H2 performance is derived as a set of parameterized LMIs whose variable matrix is a polynomial of the parameter, where a bound of its degree is given explicitly. Then, the parameterized LMIs are transformed exactly to parameter-independent and finite-dimensional LMIs.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

不確かな線形システムに対する厳密なロバストH2性能解析

twitter
facebook
mendeley

Bibtex

Ris

ロボットマニピュレータのリンク摩擦補償を含む適応H∞制御

佐藤 和也, 向井 寛, 鶴田 和寛

pp. 271-273

DOI:

10.5687/iscie.20.271
mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

ロボットマニピュレータのリンク摩擦補償を含む適応H∞制御

twitter
facebook
mendeley

Bibtex

Ris

論文アクセスランキング

16 May. (Last 30 Days)

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

詳細検索

論文タイトル

著者

抄録

ジャーナル名

年

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

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