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. 15 (2002), No. 8

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. 15 (2002), No. 8

Robust Model Reference Control Systems with Online Adjustable Parameters

Ryo WATANABE, Daisuke KATAYAMA, Kenko UCHIDA

pp. 387-395

DOI:

10.5687/iscie.15.387

Abstract

In this paper, we consider a design of the model reference control systems with adjustable parameters for linear systems with time-varying parametric uncertainties. To discuss this problem, we focus on the output error between the plant and the reference model, and adopt the reachable domain of this error as a performance index. This reachable domain is known as an output reachable set. Based on the analysis technique of output reachable sets, we propose a new design technique of the model reference controller, and demonstrate its efficacy by numerical case studies.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Robust Model Reference Control Systems with Online Adjustable Parameters

twitter
facebook
mendeley

Bibtex

Ris

Self-Generation of Gait Pattern in Quadruped Walking Robot Using Vector Quantizing Search Method (VQSM)

Takashi OTSUKI, Lip Tong TAN, Teruhiko OHTOMO

pp. 396-403

DOI:

10.5687/iscie.15.396

Abstract

In this paper, we describe the self-generation of gait pattern in quadruped walking robot. The gait of robot is generated by the neural network CPG : Central Pattern Generator, and the robot learns the gait pattern by finding the optimal weights in CPG. In addition to the traditional optimization methods such as GA : Genetic Algorithm, and LSM : Likelihood Search Method, we propose the new optimization method VQSM : Vector Quantizing Search Method, which finds gradient from the finite quantized vectors to be applicable to the discontinuous search space, and which inherits intensification and diversification of search from LSM to find the global optimum in the search space. The simulation result of self-generation of gait pattern shows that VQSM has an advantage of optimization over LSM and an advantage of computational amount over GA. It is also shown that, like the gait of animals, according to walking speed, the optimal gait becomes Bound from Trot.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Self-Generation of Gait Pattern in Quadruped Walking Robot Using Vector Quantizing Search Method (VQSM)

twitter
facebook
mendeley

Bibtex

Ris

Robust Control Giving Consideration to Time Response for a Linear System with Uncertainties

Hidetoshi OOYA, Kojiro HAGINO

pp. 404-412

DOI:

10.5687/iscie.15.404

Abstract

In this paper, we present a robust controller design method which achieves not only robust stability but also performance robustness for a linear multivariable system with norm bounded or structured additive uncertainties. The performance robustness means that the deterioration of control performance is suppressed when we compare the time response for the real system with the desirable one generated by using the nominal system directly. In this approach, we assume that the control law consists of a state feedback with the feedback gain which is designed in order to generate the desirable transient behavior for the nominal system and a compensation input for the uncertainties. The compensation input is determined so that the upper bound of a quadratic cost function for the error system between the real and the nominal system is minimized. We show that stability of the error system is reduced to the solvability of a Riccati Equation and give a guide to set up a design parameter. Finally, numerical examples are presented.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Robust Control Giving Consideration to Time Response for a Linear System with Uncertainties

twitter
facebook
mendeley

Bibtex

Ris

Real-Time Scheduling on Dial-a-Ride Vehicle Service

Keiichi UCHIMURA, Ryota WAKABAYASHI, Shuhei SAKAI

pp. 413-421

DOI:

10.5687/iscie.15.413

Abstract

We have proposed a hierarchical new public transportation operating control system aiming at dissolution of traffic congestion and the road traffic problem of the environmental pollution. In the lowest level of this system, there is the Dial-a-Ride problem. Real-time processing needs to be smoothly performed with time restriction of a getting-on-and-off vehicle demand, or a departure interval. In this paper, a method of randomizing the departure interval with consideration to the entrainment efficiency of a vehicle is proposed. Moreover, we propose a method of evaluating fitness which is considering the entrainment efficiency of vehicle, that adopts the technique used genetic algorithm for the round path planning. As a result, we confirm the real-time control by adopting irregular departure method is more economical than that using plural departure methods, and the method of evaluating fitness for improved entrainment efficiency is useful.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Real-Time Scheduling on Dial-a-Ride Vehicle Service

twitter
facebook
mendeley

Bibtex

Ris

Evolutionary Computation Based on Sexual Selections Driving Asymmetrical Mutations

Kiyohiro OMORI, Yoshi FUJIWARA, Satoshi MAEKAWA, Hidefumi SAWAI, Shinzo KITAMURA

pp. 422-429

DOI:

10.5687/iscie.15.422

Abstract

We propose a computational model which includes adaptive mutation and sexual selection, and investigate functional aspects of the model by examining self-adaptation processes of mutation under the sexual selection. In mating, each female observes males' traits in a phenotypic space, then chooses a male according to her own preference. Therefore, the selection pressure for males is different from that for females. This method was applied for the maximum search problem of a 2-dimensional complicated function. The simulation result showed that the proposed method can escape local optima by the runaway effect of males' traits and females' preferences, and this process leads the system to the intermittent evolution. In this phase, an asymmetrical mutation was driven, which provided the different roles of searching strategies depending on sex. The females were conservative with low mutation rates, while the males were innovative with higher mutation rates. As a result, the proposed method was able to search larger maxima than the conventional methods.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Evolutionary Computation Based on Sexual Selections Driving Asymmetrical Mutations

twitter
facebook
mendeley

Bibtex

Ris

Robust Speed Control of Ultrasonic Motors via Gain-Scheduled H∞ Control on Stator Vibration Amplitude

Yasuhide KOBAYASHI, Tetsuya KIMURA, Shigeo YANABE

pp. 430-437

DOI:

10.5687/iscie.15.430

Abstract

This paper deals with a controller synthesis problem for precise speed control systems of ultrasonic motors (USMs) considering nonlinear characteristics of USMs. For this problem, we firstly propose a parameter varying plant model which represents the nonlinear characteristics by using information of amplitude of stator vibration as a model parameters. Secondly, to provide higher performance for the systems, we design a parameter varying controller in a systematic way by applying gain-scheduled H∞ control technique for the parameter varying plant model. In addition, control experiments show the validity of the proposed method.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Robust Speed Control of Ultrasonic Motors via Gain-Scheduled H∞ Control on Stator Vibration Amplitude

twitter
facebook
mendeley

Bibtex

Ris

Maximizing the Number of Charging Slabs for Aluminum Reheating Furnaces by Using Constraint Logic Programming

Hitoshi TAKAYANAGI, Yoshihide OKAMURA, Ikuya HOSHINO, Kouichi TAJI, Hiroyuki TAMURA

pp. 438-446

DOI:

10.5687/iscie.15.438

Abstract

This paper discusses a complex arrangement problem for maximizing the number of charging slabs for an aluminum reheating furnaces. It is important to decide the slabs arrangement that many number of slabs enable to charge into a furnace to improve the productivity and reduce the fuel costs. Usually, the meta-heuristic approach for instance genetic algorithm (GA) or the simulated annealing (SA) has been used to solve the combinatorial optimization problem such as a cutting stock problem or a rectangle-packing problem. This problem is similar to above problems, but it is quite different from them in considering the constraint of rolling sequence, slab transportation, and change of constraint dynamically when the slabs are extracted from a furnace according to rolling sequence. In this paper, we propose constraint logic programming (CLP) based approach. The remarkable points of this approach are the addition of redundant constraints, application of slab grouping method and so on to improve the solution time. We confirm the effectiveness of the proposed approach by numerical experiments and show that it can obtain a good solution in practical time.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Maximizing the Number of Charging Slabs for Aluminum Reheating Furnaces by Using Constraint Logic Programming

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.