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

ジャーナル

論文検索サイト

アカウント

© 2022 Steel Science Portal

ヘルプ

詳細検索

論文検索サイト

site
site
site
site

システム/制御/情報 Vol. 30 (2017), No. 9

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

キーワードランキング

23 Nov. (Last 30 Days)

システム/制御/情報 Vol. 30 (2017), No. 9

リニアチャープ音の2ch観測信号間のクロススペクトルを用いた音響測距の基礎的検討

中迫 昇, 本多 進哉, 篠原 寿広, 上保 徹志

pp. 339-346

DOI:

10.5687/iscie.30.339

抄録

The distance to a target is fundamental information in many engineering applications. Recently,an acoustic distance measurement (ADM) method has been proposed based on the interference between transmitted and reflected waves, but it requires two applications of the Fourier transform. The ADM method in which a linear chirp whose frequency changes linearly with lapse of time is adopted as a transmitted sound has been also proposed. However, due to the influence of the measuring system from the loudspeaker to the microphone, the ADM would often estimate the spurious short distance different from true distance. This paper describes a fundamental study on the ADM method by applying the cross-spectral method to observed signals of the adjacent two-channel (2ch) microphones, adopting a linear chirp as transmitted wave and removing the influence of the measuring system. More concretely, since the component of the interference of the transmitted wave and reflected wave is included in the observed signal and the interference is a function of the distance from the microphone to the target, the distance can be estimated by utilizing the interference. We confirmed the validity of the chirp-based ADM method by performing a computer simulation and by applying it to an actual sound field.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

リニアチャープ音の2ch観測信号間のクロススペクトルを用いた音響測距の基礎的検討

twitter
facebook
mendeley

Bibtex

Ris

総納期ずれ最小化のためのマルチエージェント強化学習を用いた自律分散型スケジューリング

岩村 幸治, 横手 隆幸, 菅野 翼, 杉村 延広

pp. 347-355

DOI:

10.5687/iscie.30.347

抄録

Multi-agent reinforcement learning have been applied to scheduling method based on utility values for autonomous distributed manufacturing systems in order to improve the objective functions of individual job agents and resource agents, in the previous researches. New distributed scheduling method based on utility values is proposed to improve the sum of earliness and tardiness of all the job agents by applying the multi-agent reinforcement learning to the resource agents, in this research. The resource agents learn the suitable criteria to determine the utility values of the candidate job agents for next machining operation based on the status of manufacturing systems. Some case studies have been carried out to verify the effectiveness of the proposed method.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

総納期ずれ最小化のためのマルチエージェント強化学習を用いた自律分散型スケジューリング

twitter
facebook
mendeley

Bibtex

Ris

浮体式洋上風力発電施設におけるタワー基部の曲げモーメントを評価したモデル予測制御

山田 雅貴, 上野 和浩, 羽田 絢, 中條 俊樹, 大塚 敏之

pp. 356-365

DOI:

10.5687/iscie.30.356

抄録

In this paper, vibration control of the bending moment of a tower base is considered to extend fatigue life of a floating offshore wind turbine (FOWT). A model of the moment is derived and a model predictive controller is designed to accomplish the goal. The controller is designed on the basis of a linear dynamic model of the FOWT. The controller uses the collective blade pitch angle as its control input. A linear dynamic model of the FOWT is constructed from the steady state responses of a precise simulator called FAST (Fatigue, Aerodynamics, Structures, and Turbulence). The control performances are then evaluated through numerical simulations on FAST. The simulations are executed under typical conditions of wind and wave. Simulation results show higher reduction rates of the moment by the model predictive controller compared to those of other control methods.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

浮体式洋上風力発電施設におけるタワー基部の曲げモーメントを評価したモデル予測制御

twitter
facebook
mendeley

Bibtex

Ris

需要家，供給家と送電家からなるネットワーク構造を持つ電力スポット市場の電力価格決定

河野 佑, 澤田 英司, 安居 貴弘, 大塚 敏之

pp. 366-372

DOI:

10.5687/iscie.30.366

抄録

In this paper, we propose a spot pricing method of an electrical network composed of consumers,suppliers, and transmission companies. The electricity pricing is formulated as a maximization problem of the sum of consumers surplus and profits of suppliers and transmission companies. If there exists a solution to the maximization problem, it is the unique solution for a system of differential algebraic equations with boundary conditions. A numerical simulation demonstrates that an electricity market consisting of two areas is designed to reduce the areal difference of electricity prices.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

需要家，供給家と送電家からなるネットワーク構造を持つ電力スポット市場の電力価格決定

twitter
facebook
mendeley

Bibtex

Ris

零空間を用いた入力多重型二重レートサンプル値制御系の設計

佐藤 孝雄, 川口 夏樹, 荒木 望, 小西 康夫

pp. 373-377

DOI:

10.5687/iscie.30.373

抄録

This paper discusses a design method for an input multiple single-input single-output dual-rate control system, where the sampling interval of the plant output is an integer multiple of the hold interval of the control input. A dual-rate control law that stabilizes a closed-loop system is extended using null-space. In the extended control system, a redundant input that is designed independently of the closed-loop system, is obtained. Because the redundant input is designed so that the control input is constant in the steady-state, the intersample ripples are eliminated without changing the reference response from the reference input to the plant output. Finally, the effectiveness of the proposed method is demonstrated through numerical examples.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

零空間を用いた入力多重型二重レートサンプル値制御系の設計

twitter
facebook
mendeley

Bibtex

Ris

論文アクセスランキング

23 Nov. (Last 30 Days)

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

詳細検索

論文タイトル

著者

抄録

ジャーナル名

年

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

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