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

ジャーナル

論文検索サイト

アカウント

© 2022 Steel Science Portal

ヘルプ

詳細検索

論文検索サイト

site
site
site
site

システム/制御/情報 Vol. 28 (2015), No. 3

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. 28 (2015), No. 3

画像特徴量による移動式マニピュレータの位置決め制御

栗田 寛樹, 飯田 訓久, 趙 元在, 村主 勝彦

pp. 85-90

DOI:

10.5687/iscie.28.85

抄録

This manuscript reports on a vision-based autonomous grain unloading system for a head-feeding combine robot. In order to perform harvesting fully autonomously, the combine robot is also required to autonomously unload the harvested grain into a wagon through the unloading auger, which is a screw auger and modelled as a 2-DOF manipulator. We presented a vision-based method for the autonomous unloading. A machine vision system was developed that consists of a camera on the combine robot and a planar target on the wagon. Based on SURF, the robot locates the wagon and positions its auger spout at an appropriate point over the wagon. We conducted field experiments to evaluate the presented method. Experimental results showed that the combine robot was able to position its auger spout at the predetermined target point with tolerable accuracy.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

画像特徴量による移動式マニピュレータの位置決め制御

twitter
facebook
mendeley

Bibtex

Ris

ラグランジュ緩和と固定ヒューリスティックスによる不確実需要下における生産計画と倉庫配置計画の統合最適化

相賀 啓右, 西 竜志, Zhang Guoqing

pp. 91-98

DOI:

10.5687/iscie.28.91

抄録

We consider an integrated optimization model for production planning and warehouse storage allocation under demand uncertainty. A deterministic problem of the integrated production planning and warehouse storage allocation problem is extended into a stochastic programming problem formulation. A Lagrangian relaxation and fix heuristic is proposed to solve the mixed integer nonlinear programming problem by decomposing the problem into single item capacitated lot sizing and warehouse storage allocation problems. The problem instances based on real data are solved in the numerical experiments. Computational results demonstrate the effectiveness of the proposed method.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

ラグランジュ緩和と固定ヒューリスティックスによる不確実需要下における生産計画と倉庫配置計画の統合最適化

twitter
facebook
mendeley

Bibtex

Ris

Genetic Algorithm Based Nesting Method with Considering Schedule for Sheet Metal Processing

Sakaguchi Tatsuhiko, Ohtani Hayato, Shimizu Yoshiaki

pp. 99-106

DOI:

10.5687/iscie.28.99

抄録

In recent years, efficient and agile manufacturing is aimed at in many manufacturing industries. In sheet metal processing, reducing the waste of raw materials and managing the suitable production schedule are the important factors for such manufacturing. Nesting is executed to determine the optimal layout for raw material. And scheduling is executed to determine the suitable schedule. Generally, nesting and scheduling are executed separately because their optimization objectives are different. However there occurs a certain trade-off between nesting and scheduling. Therefore, those problems should be considered simultaneously in order to increase the efficiency of entire manufacturing activity. Under such understanding, in this study, we propose an nesting method with considering schedule. In this method, we apply Genetic Algorithm to solve the nesting problem. We propose a new fitness function which considers both reduction of waste material and minimizing total tardiness. Finally, we verify the effectiveness of the proposed method through some computational experiments.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

Genetic Algorithm Based Nesting Method with Considering Schedule for Sheet Metal Processing

twitter
facebook
mendeley

Bibtex

Ris

ゼロサプレス型BDDを用いた動的生産プランニングの統合的解候補表現のための解法

高橋 啓太, 小野里 雅彦, 田中 文基

pp. 107-115

DOI:

10.5687/iscie.28.107

抄録

Dynamic changes as machine breakdowns make current production plan infeasible and inaccurate. The influence of dynamic changes spread to whole production planning that consists of several domains such as process planning, production scheduling and so on. In this study, solution space in the production planning is defined as comprehensive. We have applied Zero-Suppressed Binary Decision Diagrams (ZDDs) for the representation of solution candidates that satisfy constraints between such domains so for. In dynamic production planning problems, manufacturing achievements and dynamic changes may make solution space change. In this paper, we define such events as constraints for ZDDs and propose an approach to update the ZDD to deal with the events. Moreover,we propose a genetic algorithm (GA) to find solutions in the ZDD. Experimental results demonstrate that the proposed approach to address such event with ZDDs and the GA are effriciently used to solve the dynamic production planning problem.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

ゼロサプレス型BDDを用いた動的生産プランニングの統合的解候補表現のための解法

twitter
facebook
mendeley

Bibtex

Ris

Framework for Functional Verication in Product Design Considering Ways and Situations of Use

Morinaga Eiji, Akasaka Takuya, Wakamatsu Hidefumi, Arai Eiji, Abiru Hijiri

pp. 116-122

DOI:

10.5687/iscie.28.116

抄録

Recent industrial globalization have increased importance of functional verification in product design for various ways / situations of use. In particular, for shortening development period, it is desired to perform functional verification and necessary modification of the design plan in the conceptual design phase. This paper describes a framework for such individual functional verification that can be applied to the conceptual design phase. A study with simple examples focusing on definition of function indicated that ways / situations of use affect functions indirectly through behavior of the product. This result implies the functional verification can be performed by modeling functions,behavior and physical phenomena caused by a way / situation of use respectively, by integrating those models and then by analyzing behavior that occurs on the integrated model. This paper presents a method based on graph modeling approach. Those three elements are modeled by function decomposition tree, Petri net and cause-and-effect graph, respectively. The designer relates the function and behavior models by interpreting transitions as sub-functions. The phenomena model is transformed into a Petri net and then integrated with the behavior model by specific places and transitions. This integration can make some behavior infeasible and shows the corresponding function cannot be satisfied. This method was applied to an example and its potential was proven.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

Framework for Functional Verication in Product Design Considering Ways and Situations of Use

twitter
facebook
mendeley

Bibtex

Ris

インターネット上の気象データを利用したニューラルネットワークによる局地降水予測

柏尾 知明, 安藤 慎, 池田 建司, 下村 隆夫

pp. 123-125

DOI:

10.5687/iscie.28.123
mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

インターネット上の気象データを利用したニューラルネットワークによる局地降水予測

twitter
facebook
mendeley

Bibtex

Ris

論文アクセスランキング

16 May. (Last 30 Days)

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

詳細検索

論文タイトル

著者

抄録

ジャーナル名

年

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

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