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

ジャーナル

論文検索サイト

アカウント

© 2022 Steel Science Portal

ヘルプ

詳細検索

論文検索サイト

site
site
site
site

システム/制御/情報 Vol. 18 (2005), No. 11

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. 18 (2005), No. 11

ディスクリプタシステムに対するスライディングモード制御

宮崎 孝, 細江 繁幸

pp. 377-385

DOI:

10.5687/iscie.18.377

抄録

In this paper we consider sliding mode control for descriptor systems. We propose a control input that bring and constrain the trajectory to a switching hyper plane and a design method of the hyper plane. We reduce this design problem to a stabilizing problem of a descriptor system. This stabilizing problem is solved by a generalized algebraic Riccati equation that has a kind of optimality. We also provide a computation method by considering a generalized eigenvalue problem

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

ディスクリプタシステムに対するスライディングモード制御

twitter
facebook
mendeley

Bibtex

Ris

時間枠制約付き往復輸送型配送スケジューリング問題に対するラグランジュ緩和法の適用

小林 達也, 沼田 一道

pp. 386-392

DOI:

10.5687/iscie.18.386

抄録

In this paper we address a piston delivery scheduling problem with time-window constraints. The feature of this problem is a piston delivery. In a piston delivery, total running cost (length) to deliver products to all customers doesn't change even if we use a lot of or a few trucks. But the number of trucks necessary to satisfy time-window constraints is varied by the delivery timing. One of main factors of the delivery cost is the number of trucks to be secured. The minimum (or near minimum) number of trucks necessary for a given delivery request is a matter of interest. We propose a new solution method using Lagrangian relaxation for this problem. Numerical experiments show that the proposed method produces solutions with 25-20% less trucks than those by simple heuristics.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

時間枠制約付き往復輸送型配送スケジューリング問題に対するラグランジュ緩和法の適用

twitter
facebook
mendeley

Bibtex

Ris

ユニモジュラな連続時間パラエルミート多項式行列のスペクトル分解アルゴリズム

金子 修, 鷹羽 浄嗣, Kiyotsugu TAKABA

pp. 393-399

DOI:

10.5687/iscie.18.393

抄録

In this paper, we address an algorithm for the spectral factorization of para-Hermitian unimodular polynomial matrices in the continuous time case. Most of the algorithms for the spectral factorizations of matrix polynomials depend on the existence of the roots of given polynomial matrices, so it is almost impossible to execute the spectral factorization of unimodular polynomial matrices. In this paper, we provide a new algorithm for the spectral factorization of unimodular polynomial matrices without the existence of the roots of polynomial matrices or the stability. The task one has to do is only to solve a linear matrix inequality consisting of the coefficients of a given unimodular matrix, which can be achieved easily by the use of numerical computation packages. The algorithm we present here is based on the property of the storage functions for the dissipative systems in which there always exists positive dissipated energy for the environment. This implies that the fundamental property in our algorithm is also a self-standing interesting result with respect to theoretical points of view. Finally, in order to show the validity of our results, we give an illustrative example with respect to numerical aspects.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

ユニモジュラな連続時間パラエルミート多項式行列のスペクトル分解アルゴリズム

twitter
facebook
mendeley

Bibtex

Ris

一回の閉ループ実験データを用いた最小二乗法に基づく制御器パラメータチューニング

金子 修, 吉田 恭子, 松本 和之, 藤井 隆雄

pp. 400-409

DOI:

10.5687/iscie.18.400

抄録

Recently, for the purpose of the minimization of the squared error between the desired and real experimental output of the plant, Iterative Feedback Tuning (IFT), Virtual Reference Feedback Tuning (VRFT), and Fictitous Reference Iterative Tuning (FRIT) were proposed as reasonable methods for tuning of the parameters of controllers. The first one requires many experiments for the updating step in Gauss-Newton method, while the later two methods requires only one-shot experimental data. Moreover, VRFT and FRIT have useful features in a complementary manner. From these backgrounds, this paper provides a new parameter tuning for controllers based on least-squares optimization by using one-shot closed loop experimental data. Here, we provide a basic idea of this approach and discuss the optimality of the obtained parameter. Moreover, we introduce the pre-filter so as to guarantee that the optimized parameter in the fictitious area corresponds to that in the real area. We also provide the algorithm of our method for enhancement of the use of this procedure. Finally we give an experimental example to illustrate the validity of our results.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

一回の閉ループ実験データを用いた最小二乗法に基づく制御器パラメータチューニング

twitter
facebook
mendeley

Bibtex

Ris

部分空間同定法に基づいた線形時変確率システムの予測とその逐次アルゴリズム

亀山 建太郎, 大住 晃

pp. 410-419

DOI:

10.5687/iscie.18.410

抄録

In this paper, a prediction method is newly proposed for time-varying stochastic linear systems in the subspace identification framework. The key to this subspace-based prediction is to regard the change of the extended observability matrix yielded by the time-varying parameters of system as the rotation of the principal vectors that span the basis of the signal subspace. The rotation rate is evaluated from the angle between the past and current signal subspaces, and the future signal subspace is predicted by rotating the current subspace. A recursive algorithm is derived and its efficacy is tested by simulation experiments.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

部分空間同定法に基づいた線形時変確率システムの予測とその逐次アルゴリズム

twitter
facebook
mendeley

Bibtex

Ris

サポートベクター回帰を用いた高速波形照合手法による無線機の個体識別

永野 隆文, 岩本 貴司

pp. 420-422

DOI:

10.5687/iscie.18.420
mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

サポートベクター回帰を用いた高速波形照合手法による無線機の個体識別

twitter
facebook
mendeley

Bibtex

Ris

論文アクセスランキング

16 May. (Last 30 Days)

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

詳細検索

論文タイトル

著者

抄録

ジャーナル名

年

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

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