logo
Language
Bookmarks
Log Out

Journals

Search Sites

Account

© 2022 Steel Science Portal

How to use

Advanced Search

Search Sites

site
site
site
site

Transactions of the Institute of Systems, Control and Information Engineers Vol. 16 (2003), No. 5

ISIJ International
belloff
ONLINE ISSN: 2185-811X
PRINT ISSN: 1342-5668
Publisher: 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

Keyword Ranking

22 Dec. (Last 30 Days)

Transactions of the Institute of Systems, Control and Information Engineers Vol. 16 (2003), No. 5

H2 Optimal Control in a Behavioral Framework

Osamu KANEKO, Takashi DOI, Takao FUJII

pp. 193-201

DOI:

10.5687/iscie.16.193

Abstract

In this paper, we address H2 optimal control problem in a behavioral framework. Firstly, we formalize H2 optimal control problem addressed here under some assumptions. Secondly, we provide a necessary and sufficient condition for a control law to be admissible : namely, it guarantees the nonrestrictiveness of the disturbance and the boundedness of H2 norm of the transfer function from disturbance variables to regulated ones as well as the stability of the interconnected system. Thirdly, we provide a necessary and sufficient condition for a control law to be H2 optimal : namely, it is an admissible control law and minimizes H2 norm of the transfer function from disturbance variables to regulated ones after the interconnection. By using this condition, we also provide a parameterization of H2 optimal control laws and then a concrete algorithm for obtaining them. Finally, an illustrative example is also given in order to show the effectiveness of our result.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

H2 Optimal Control in a Behavioral Framework

twitter
facebook
mendeley

Bibtex

Ris

Design of an Augmented Automatic Choosing Control by GA for Nonlinear Systems with Constrained Input

Toshinori NAWATA, Hitoshi TAKATA

pp. 202-208

DOI:

10.5687/iscie.16.202

Abstract

In this paper a nonlinear feedback control called augmented automatic choosing control (AACC) for a class of nonlinear systems with constrained input is presented. When designed the control, a constant term which arises from linearization of a given nonlinear system is treated as a coefficient of a stable zero dynamics. Parameters of the control are suboptimally selected by maximizing the stable region in the sense of Lyapunov with the aid of a genetic algorithm.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Design of an Augmented Automatic Choosing Control by GA for Nonlinear Systems with Constrained Input

twitter
facebook
mendeley

Bibtex

Ris

On-Line EM Reinforcement Learning for Automatic Control of Continuous Dynamical Systems

Junichiro YOSHIMOTO, Shin ISHII, Masa-aki SATO

pp. 209-217

DOI:

10.5687/iscie.16.209

Abstract

In this paper, we propose a new reinforcement learning (RL) method for dynamical systems that have continuous state and action spaces. Our RL method has an architecture like the actorcritic model. The critic tries to approximate the Q-function, and the actor tries to approximate a stochastic soft-max policy dependent on the Q-function. An on-line EM algorithm is used to train the critic and the actor. We apply this method to two control problems. Computer simulations in two tasks show that our method is able to acquire good control after a few learning trials.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

On-Line EM Reinforcement Learning for Automatic Control of Continuous Dynamical Systems

twitter
facebook
mendeley

Bibtex

Ris

Development of a Simulator of a Class of Piecewise Affine Systems

Tsuyoshi KUNIKANE, Jun-ichi IMURA, Masami SAEKI

pp. 218-225

DOI:

10.5687/iscie.16.218

Abstract

This paper treats the simulation problem of multi-modal piecewise affine systems with binary-switches. First, it is pointed out by numerical examples that some problems on the event detection occur in the existing simulators when a solution of the system crosses an intersection of multiple switching hyperplanes. Next, a new simulation algorithm is proposed under the switch-based transition rule.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Development of a Simulator of a Class of Piecewise Affine Systems

twitter
facebook
mendeley

Bibtex

Ris

3D Reconstruction of Surfaces Using Scanline Stereo Matching Based on Color Segmentation

Masami IWATSUKI, Yuichi KATASE, Natsuki TANI

pp. 226-233

DOI:

10.5687/iscie.16.226

Abstract

Recently, a robust method of stereo matching using coarse to fine hierarchical color segmentation on each scanline in stereo images has been proposed. However, the stereo matching method has a crucial problem that several fault correspondences cannot be removed in the case of that a lot of similar color segments exist on same scanlines. Therefore, this paper proposes an advanced approach to detect and remove fault correspondences by taking into account of consistency of disparity of region contours. Furthermore, by using a Delaunay triangulation and a finite element method, the proposed method can reconstruct 3D structures of surfaces with the contours which are obtained by a suboptimal 3D line segmentation.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

3D Reconstruction of Surfaces Using Scanline Stereo Matching Based on Color Segmentation

twitter
facebook
mendeley

Bibtex

Ris

Application of Genetic Algorithm to No-buffer Jobshop Scheduling Problems

Gui Fu, Yong ZHAO, Nobuo SANNOMIYA

pp. 234-241

DOI:

10.5687/iscie.16.234

Abstract

A genetic algorithm (GA) is proposed to solve no-buffer jobshop scheduling problems. In the case of applying the standard GA to these problems, no-buffer constraint leads to a deadlock state in the meaning that an operation cannot be processed on the next machine in a pre-defined machine sequence. Because it causes many infeasible solutions, the standard GA cannot perform an efficient search. In this paper, we propose a new semi-active decoding method which avoids the deadlock to generate a feasible solution. Computer experiments on some modified benchmark problems show that the proposed GA performs efficient search and obtains equivalent or better schedules than other algorithms proposed previously.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Application of Genetic Algorithm to No-buffer Jobshop Scheduling Problems

twitter
facebook
mendeley

Bibtex

Ris

Optimal Layout of Rectangular Workpieces in a Multi-Robot Welding System

Yoshihiro KANJO, Hajime ASE

pp. 242-248

DOI:

10.5687/iscie.16.242

Abstract

Increasing the productivity by reducing waiting times for collision avoidance between adjacent robots has been an important issue in multi-robot welding systems. Minimization of welding job completion time by path optimization is one of the methods for the purpose. Optimization of directions and positions of workpieces when arranging them on the working stage is more effective method. In case of rectangular workpiece, the algorithm for optimizing directions by tabu search and positions by nonlinear programming has been developed in this research. Its effectiveness is shown by numerical simulations with practical workpieces.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Optimal Layout of Rectangular Workpieces in a Multi-Robot Welding System

twitter
facebook
mendeley

Bibtex

Ris

A Synthesis of Sampled-Data H∞ Robust Servo Systems with Frequency-Dependent Weighting Functions

Hisaya FUJIOKA

pp. 249-251

DOI:

10.5687/iscie.16.249
mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Synthesis of Sampled-Data H∞ Robust Servo Systems with Frequency-Dependent Weighting Functions

twitter
facebook
mendeley

Bibtex

Ris

Article Access Ranking

22 Dec. (Last 30 Days)

You can use this feature after you logged into the site.
Please click the button below.

Advanced Search

Article Title

Author

Abstract

Journal Title

Year

Please enter the publication date
with Christian era
(4 digits).

Please enter your search criteria.