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. 14 (2001), No. 2

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.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

Keyword Ranking

21 Nov. (Last 30 Days)

Transactions of the Institute of Systems, Control and Information Engineers Vol. 14 (2001), No. 2

Simplification of Feed System of Circular Array Antenna Using Genetic Algorithm

Shigeru OKUBO

pp. 43-51

DOI:

10.5687/iscie.14.43

Abstract

The desired directivities and gains of array antenna with a large number of radiating elements are easy to obtain. By considering array antenna as an aggregate of subarrays, the design, production, inspection and maintenance are simplified, and the reduction in cost can be carried out. Genetic Algorithms are “global” numerical-optimization methods, patterned after the natural processes of genetic recombination and evolution. In this paper, circular array antenna is divided into subarrays. Then, the source distribution of circular array antenna can be approximated as a Taylor distribution by combining subarrays having the same source distribution using Genetic Algorithm so that the simplification of feed system becomes possible.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Simplification of Feed System of Circular Array Antenna Using Genetic Algorithm

twitter
facebook
mendeley

Bibtex

Ris

Travel Control for Robot Vehicle Using Neural Networks in Dynamic Environment

Teruhiko OHTOMO, Minoru KODAIRA, Takashi OTSUKI, Takao OHUCHI

pp. 52-61

DOI:

10.5687/iscie.14.52

Abstract

This paper proposes a more flexible and effective obstacle avoidance travel control system based on the switching of the thought in dynamic environment where many autonomous robot vehiecles move. The proposed system plans various traveling paths by the Cascaded Neural Networks (CNN) which operates by a traffic rule or knowledge, so that robot vehiecle can smoothly move the best suited route by evaluating the energy function value of those paths. To show the effectiveness of the control system, we carried out a computer simulation of the obstacle avoidance by using four vehiecle models, and confirmed that each vehiecle can avoid other vehiecles without falling into the deadlock.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Travel Control for Robot Vehicle Using Neural Networks in Dynamic Environment

twitter
facebook
mendeley

Bibtex

Ris

Derivation of Stabilizing Controller Based on Minimal-Order Observer and Application to Design of Frequency-Shaping ILQ Servo System

Keiko NAKAMURA, Masaya SAKAI, Ken'ichi NAKASHIMA, Takao FUJII

pp. 62-70

DOI:

10.5687/iscie.14.62

Abstract

In our preceding paper, a design method for an ILQ robust servo system with a full-order obsever and a free parameter was proposed. In this paper, we propose a similar method for an ILQ servo system with a minimal-order observer and a free parameter. First, we derive a stabilizing controller based on a minimal-order observer from a full-order observer-based stabilizing controller by equivalent transformation. Then we apply it to design a frequency-shaping ILQ servo system. Finally, we show a design example for a magnetic levitaion system.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Derivation of Stabilizing Controller Based on Minimal-Order Observer and Application to Design of Frequency-Shaping ILQ Servo System

twitter
facebook
mendeley

Bibtex

Ris

An Application of the Interior Point Method to some Mixed Integer Programming Problems

Kazunori SAWAI, Osamu SAEKI, Kiichiro TSUJI

pp. 71-77

DOI:

10.5687/iscie.14.71

Abstract

Mixed Integer Programming (MIP) problems are widely used. They are generally solved by the branch and bound method. It requires much calculation time to solve these problems. The first relaxed problems of MIP problems occasionally have several optimal basic solutions. In this paper, we propose a method which is an application of the interior point method to the branch and bound method for these problems. It is shown that the proposed method has an advantage over the conventional method. A numerical study on the optimal operation problem of the cogeneration system which is one of MIP problems shows that the proposed method reduces the number of subproblems and the computational time.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

An Application of the Interior Point Method to some Mixed Integer Programming Problems

twitter
facebook
mendeley

Bibtex

Ris

Iterative Feedback Tuning of Controllers for a Two-Mass Spring System with Friction

Kenichi HAMAMOTO, Takahiro FUKUDA, Toshiharu SUGIE

pp. 78-85

DOI:

10.5687/iscie.14.78

Abstract

In this paper, we present a two-degree-of-freedom controller tuning for two-mass spring systems with friction based on the IFT (Iterative Feedback Tuning) approach. Existing IFT methods may not work very well for such a system because they heavily rely on the linearity of the plants. In order to cope with such cases, we adopt two strategies. One is the separate tuning of the feedback and feedforward controller. The other is to introduce a quasi-Newton method into a parameter renewal law. Finally, we evaluate its effectiveness by an experiment.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Iterative Feedback Tuning of Controllers for a Two-Mass Spring System with Friction

twitter
facebook
mendeley

Bibtex

Ris

A New Method for Reinforcement Learning with Position Vector in Partially Observable Markov Decision Process

Moriaki KIYOMOTO, Katsuari KAMEI

pp. 86-91

DOI:

10.5687/iscie.14.86

Abstract

This paper describes a reinforcement learning with a position vector, which does not fall into Partially Observable Markov Decision Process (POMDP). Firstly, a rule structure using the position vector as agent's inside sensory information and a restraint of reward assignment for detours are described and then a new reinforcement learning method composed of them is proposed. Next, the proposed method is compared with a conventional method for relatively simple Partial Observation Markov Environment (POME). As a result, it is shown that the reward assignment to unnecessary rules is restrained, that is, the rewards are given to only effective rules and then an efficient learning is carried out. In addition, we apply the proposed method to the shortest path acquisition problem of POME which can hardly be solved by the conventional method, and obseve that an optimum solution is obtained by the proposed method. Finally, the proposed method is successfully applied to a huge maze used in Japan micro-mouse competition, which shows that the proposed method is effective for such realistic problems.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A New Method for Reinforcement Learning with Position Vector in Partially Observable Markov Decision Process

twitter
facebook
mendeley

Bibtex

Ris

Article Access Ranking

21 Nov. (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.