Search Sites

Transactions of the Institute of Systems, Control and Information Engineers Vol. 11 (1998), No. 11

ISIJ International
belloff
ONLINE ISSN: 2185-811X
PRINT ISSN: 1342-5668
Publisher: THE INSTITUTE OF SYSTEMS, CONTROL AND INFORMATION ENGINEERS (ISCIE)

Backnumber

  1. Vol. 36 (2023)

  2. Vol. 35 (2022)

  3. Vol. 34 (2021)

  4. Vol. 33 (2020)

  5. Vol. 32 (2019)

  6. Vol. 31 (2018)

  7. Vol. 30 (2017)

  8. Vol. 29 (2016)

  9. Vol. 28 (2015)

  10. Vol. 27 (2014)

  11. Vol. 26 (2013)

  12. Vol. 25 (2012)

  13. Vol. 24 (2011)

  14. Vol. 23 (2010)

  15. Vol. 22 (2009)

  16. Vol. 21 (2008)

  17. Vol. 20 (2007)

  18. Vol. 19 (2006)

  19. Vol. 18 (2005)

  20. Vol. 17 (2004)

  21. Vol. 16 (2003)

  22. Vol. 15 (2002)

  23. Vol. 14 (2001)

  24. Vol. 13 (2000)

  25. Vol. 12 (1999)

  26. Vol. 11 (1998)

  27. Vol. 10 (1997)

  28. Vol. 9 (1996)

  29. Vol. 8 (1995)

  30. Vol. 7 (1994)

  31. Vol. 6 (1993)

  32. Vol. 5 (1992)

  33. Vol. 4 (1991)

  34. Vol. 3 (1990)

  35. Vol. 2 (1989)

  36. Vol. 1 (1988)

Transactions of the Institute of Systems, Control and Information Engineers Vol. 11 (1998), No. 11

Reinforcement Learning Using Regularization Theory to Treat the Continuous States and Actions

Takanori FUKAO, Norikatsu INEYAMA, Norihiko ADACHI

pp. 593-599

Abstract

Reinforcement learning is to learn how to act optimally in an unknown environment. It requires only a scalar reinforcement signal as performance feedback from the environment. Q-learning is one of the famous algorithms for the reinforcement learning. This paper presents a new method that is able to treat the continuous states and actions in the Q-learning. That is because a Q-function is smoothly approximated by using regularization theory.

Bookmark

Share it with SNS

Article Title

Reinforcement Learning Using Regularization Theory to Treat the Continuous States and Actions

Genetic Algorithms Using Pareto Partitioning Method for Multiobjective Optimization Problem

Takanori TAGAMI, Tohru KAWABE

pp. 600-607

Abstract

In this paper, a genetic algorithm using a Pareto partitioning method to multiobjective optimization problems is proposed. The purpose of the proposed method is to generate a set of non-dominated solutions that is properly distributed in the neighborhood of the trade-off surface. The genetic search using the proposed method uniformly controls the convergence of non-dominated solutions in the objective space. Simulation results show that the GA using the Pareto partitioning method has good performances better than the traditional GA approaches for several 2-objective function optimization problems and 2-objective flow-shop scheduling problems.

Bookmark

Share it with SNS

Article Title

Genetic Algorithms Using Pareto Partitioning Method for Multiobjective Optimization Problem

Decoupling Control Using a Limiting Property of Linear Optimum Regulators and Application to Controlthe Shinansha

Nobuaki KOBAYASHI, Mitsuki KAWASHIMA, Mitsuhiro SAKURAI, Kazuo KANZAKI

pp. 608-615

Abstract

We discuss a property of the limiting form derived by letting the weighting matrix with output vector tend to infinity in a standard linear regulator problem. In this paper, it is shown that there exists an explicit relationship between the limiting form and decoupling control in continuos linear systems. The new designing procedure for deriving the decoupling control law is presented, using this limiting property. We try to apply the proposed procedure to control the Shinansha.

Bookmark

Share it with SNS

Article Title

Decoupling Control Using a Limiting Property of Linear Optimum Regulators and Application to Controlthe Shinansha

Stabilization of Generalized Hamiltonian Systems

Kenji FUJIMOTO, Toshiharu SUGIE

pp. 616-622

Abstract

The generalized Hamiltonian systems are generalization of well-known Hamiltonian systems, which include various passive electric circuit systems as well as mechanical ones. This paper introduces the canonical transformation for the generalized Hamiltonian systems, which preserves the Hamiltonian structure of the original system and is expected to provide new insights and useful tools for analysis and synthesis of such systems. First, the class of such transformations and some of their properties are clarified. Second, we show how to stabilize the generalized Hamiltonian systems by using the transformation. This method works even when we can not stabilize them by conventional unity feedback without canonical transformation. Furthermore, it is shown that the proposed stabilization method includes the well-known one which exploits the virtual potential energy.

Bookmark

Share it with SNS

Article Title

Stabilization of Generalized Hamiltonian Systems

Nonlinear Controller Design for Linear Systems via the Parametrization of Nonlinear Stabilizing Controllers

Kenji FUJIMOTO, Akira OGA, Toshiharu SUGIE

pp. 623-629

Abstract

This paper concerns a nonlinear controller design for linear systems. We give a concrete method to design a nonlinear controller which smoothly switches linear compensators depending on the state of the plant. Then we apply the method to a plant with an input saturation and evaluate its effectiveness by simulations.

Bookmark

Share it with SNS

Article Title

Nonlinear Controller Design for Linear Systems via the Parametrization of Nonlinear Stabilizing Controllers

A System Representation and a Control Strategy Based on an Input-Output Data Array

Yasumasa FUJISAKI, Yiran DUAN, Masao IKEDA

pp. 630-637

Abstract

This paper proposes a control strategy based on an array representation of input-output data of a plant. The control strategy requires no traditional mathematical model such as a transfer function or a state-space equation. The plant dynamics is represented as a set of basis arrays whose elements are plant input-output data. Then a set of canonical basis arrays is derived from the set of basis arrays by a sweep-out calculation. The control input for dead-beat tracking is directly computed using the set of canonical basis arrays.

Bookmark

Share it with SNS

Article Title

A System Representation and a Control Strategy Based on an Input-Output Data Array

Automatic Extraction of Brain Tissues by Using Knowledge

Yukio TADA, Shigeki FUKUNISHI

pp. 638-645

Abstract

To realize brain surgery simulation system or automatic diagnostic system of brain diseases which make use of cross-sectional images taken by MRI, it is necessary to extract and recognize principal tissues in the image automatically. There have been many researches about extraction of tissues, but previous methods have weak points : that is, the process of the extraction is slow and its result is rough. In order to overcome these drawbacks, we propose a new method which enables us to extract principal tissues automatically and fast by using knowledge. This method is based on binarization and classification of regions. At the classification process, we make use of an information on shapes of ventricles and relative locations between ventricles, which are given beforehand as knowledge. Our method uses T1 and T2 weighted images taken by Spin Echo method as original images and we extract white matter, gray matter, ventricles and celebrospinal fluid other than ventricles in these images.

Bookmark

Share it with SNS

Article Title

Automatic Extraction of Brain Tissues by Using Knowledge

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.