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

ジャーナル

論文検索サイト

アカウント

© 2022 Steel Science Portal

ヘルプ

詳細検索

論文検索サイト

site
site
site
site

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

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

キーワードランキング

22 Dec. (Last 30 Days)

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

弾性波探査のためのドローン群の巡回経路最適化

濱里 洋平, 坂口 聡範, 山本 薫, 辻 健

pp. 181-186

DOI:

10.5687/iscie.36.181

抄録

We study the problem of optimal route generation for visiting measurement points in seismic surveys. For this purpose, we consider the employment of multiple drones to install seismometers at the measurement points. An algorithm combining fuzzy clustering and the traveling salesman problem is proposed to generate an energy-efficient path for each drone. Several practical conditions typically arising in this application are also taken into account.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

弾性波探査のためのドローン群の巡回経路最適化

twitter
facebook
mendeley

Bibtex

Ris

災害時における配電系統内の電力供給継続を目的とした協調的電力供給システム

関崎 真也, 西崎 一郎, 林田 智弘, 香川 和輝, 當麻 晃由

pp. 187-198

DOI:

10.5687/iscie.36.187

抄録

This paper proposes a cooperative electric power supply system based on cooperative game theory, aiming to design monetary incentives for consumers to install energy resources that contribute to the continuous power supply to them in case of power interruption by disasters. The proposed system designs the incentives by maximizing the long-term profits gained by controlling photovoltaic generation systems (PVs), controllable loads, and batteries during normal operations. The proposed system employs a two-stage optimization method for scheduling battery operations under the uncertainty of PV generation during normal operations to alleviate its heavy computational burden. Since the profit allocated to each consumer participating in the proposed system is determined based on the imputation in the core, the solution of cooperative game theory, the consumers have no incentive to leave the grand coalition. When the power supply from the distribution network is interrupted during the disaster, the consumers cooperate to control their PVs and batteries to continue supplying the electric power to them using the installed resources until the power supply is restored. The effectiveness of the proposed system is verified by computational experiments under normal and disaster conditions.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

災害時における配電系統内の電力供給継続を目的とした協調的電力供給システム

twitter
facebook
mendeley

Bibtex

Ris

ガウス過程回帰を用いたTwo-swarm Cooperative PSOの改良

林田 智弘, 西崎 一郎, 関崎 真也, 柏原 優樹

pp. 199-211

DOI:

10.5687/iscie.36.199

抄録

Particle Swarm Optimization (PSO) is a type of evolutionary computation developed to mimic the behaviour of a flock of birds searching for food. Particles with positional information and velocity search for solutions as they move through the search space, sharing information across all particles to efficiently search for solutions. In PSO, only the positional information of the best solution is shared to update the velocity, which causes problems such as insufficient search, failure to find a global solution, and early convergence to a local solution. Sun and Li (2014) have proposed TCPSO (Two-swarm Cooperative Particle Swarm Optimization) with a slave particle swarm for intensive solution exploration. However, for high-dimensional and complex problems, even TCPSO sometimes falls into the trap of local solutions. This paper aims to improve the performance of TCPSO by using a Gaussian process to estimate the approximate shape of the function of the problem in the solution search process.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

ガウス過程回帰を用いたTwo-swarm Cooperative PSOの改良

twitter
facebook
mendeley

Bibtex

Ris

階層的探索による二次元配置配線最適化

谷村 亮介, 東 優貴, 高野 諒, 西川 郁子

pp. 212-219

DOI:

10.5687/iscie.36.212

抄録

Two-dimensional layout problem is studied to minimize the wiring cost by optimal layout of the devices and wiring path connecting the devices. The present study divides the problem into a parent problem of device layout and a child problem of wiring under the given device layout and repeats to solve each problem iteratively. The decision variables of device layout are mixed with discrete variables for the direction and continuous variables for the location. Therefore, the location is discretized as target points, and each device is located at the point nearest to the given target point under the given constraints. Computer experiments are conducted to show the effectiveness of the proposed method, where simulated annealing is applied to a device layout and particle swarm optimization is applied to a wiring problem. Moreover, it is observed that the directions of the devices are gradually fixed in the descending order of the device size during the search, and the interval of the target points as the discretization size does not significantly affect the quality of the obtained solution, which is considered to be caused by the given constraints and a translational symmetry in the total wiring length under the present geometric constraints.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

階層的探索による二次元配置配線最適化

twitter
facebook
mendeley

Bibtex

Ris

Modified State Predictive Control Aiming at Improving Robust Stability

Tomomichi Hagiwara, Shotaro Yanase, Yoichiro Masui, Kentaro Hirata

pp. 220-228

DOI:

10.5687/iscie.36.220

抄録

Finite spectrum assignment, also known as state predictive control, is an effective control method for systems with time delay in the input. This paper considers introducing some modification on the control law of state predictive control, where the modification can be interpreted, roughly speaking, as suitably taking account of the (intentionally introduced) deviation of the past input from what is desired in the sense of the conventional state predictive control. The motivation for introducing such modification lies in an attempt to modify the dynamics of the controller while maintaining a feature of the conventional state predictive control to a certain extent. In particular, we aim at improving robust stability for non-parametric uncertainties of the plant. We first derive the characteristic equation of the modified state predictive control systems, and give a necessary and sufficient condition for stability. We then derive an explicit representation of the complementary sensitivity function associated with the robust stability analysis problem for multiplicative uncertainties. Finally, we demonstrate through a numerical example that modified state predictive control can indeed be useful for improving robust stability if the modification is introduced suitably.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

twitter
facebook
mendeley

Bibtex

Ris

論文アクセスランキング

22 Dec. (Last 30 Days)

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

詳細検索

論文タイトル

著者

抄録

ジャーナル名

年

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

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