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. 12 (1999), 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. 38 (2025)

    1. No.3
    2. No.2
    3. No.1

  2. Vol. 37 (2024)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

15 Jun. (Last 30 Days)

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

Semi-Global L2 Gain Analysis of Linear Systems with Self-Scheduling Parameters

Takehito AZUMA, Ryo WATANABE, Kenko UCHIDA

pp. 639-646

DOI:

10.5687/iscie.12.639

Abstract

In this paper, we consider semi-global L2 gain analysis for nonlinear systems described as linear systems with self-scheduling parameters. First we show a method to convert linear systems with self-scheduling parameters into linear systems with scheduling parameters based on evaluation of the domain of the self-scheduling parameters. Second, using the tools for linear systems with scheduling parameters, we discuss semi-global L2 gain analysis for the nonlinear systems and propose an approach together with feasible formulas of computation, which provides a solution to the so-called hidden loop problem in gain scheduling. Finally, we show numerical examples.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Semi-Global L2 Gain Analysis of Linear Systems with Self-Scheduling Parameters

twitter
facebook
mendeley

Bibtex

Ris

Stabilization of a Class of Nonholonomic Systems without Drift Using Time-State Control Form

Hiromitsu KIYOTA, Mitsuji SAMPEI

pp. 647-654

DOI:

10.5687/iscie.12.647

Abstract

The authors have proposed the time-state control form and its control strategy to control a class of nonholonomic systems without a drift term, which method is more useful, or has broader applicable class of systems, than the chained form one. In this paper, necessary and sufficient conditions for transformation of a class of nonholonomic systems into the time-state control form are given, and new control strategy for the time-state control form to ensure the (exponential) stabilization of the subsystem by some sort of Lyapunov's discussion is also presented. For each of the topics, simple and illustrative example will be shown.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Stabilization of a Class of Nonholonomic Systems without Drift Using Time-State Control Form

twitter
facebook
mendeley

Bibtex

Ris

LPV Modeling and Gain Scheduled Control of ALFLEX Vehicle Flight Systems

Atsumi OHARA, Masakazu IDE, Yasuhiro YAMAGUCHI, Masahiro OHNO

pp. 655-663

DOI:

10.5687/iscie.12.655

Abstract

In this paper, we show a result of practical flight control systems synthesis adopting recently developed gain scheduled control framework. First, we propose a general method to obtain linear parameter varying (LPV) model with norm bounded uncertainties from state space realization data at several operation points. Using the obtained LPV model, we next give a method to design a gain scheduling controller that satisfies multiple control specifications including classical stability margin. Finally, we apply these methods to the flight control systems synthesis of ALFLEX vehicle that requires many practical control specifications.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

LPV Modeling and Gain Scheduled Control of ALFLEX Vehicle Flight Systems

twitter
facebook
mendeley

Bibtex

Ris

Design of a Static Anti-Windup Compensator which Guarantees Robust Stability

Nobutaka WADA, Masami SAEKI

pp. 664-670

DOI:

10.5687/iscie.12.664

Abstract

In this paper, a design method of a static anti-windup compensator which guarantees robust stability subject to saturation nonlinearities and which attenuates a windup phenomena is proposed. Although this design problem has been considered as a non-convex problem in the previous works, we will show that it can be converted into a convex problem and described by linear matrix inequalities. Two numerical examples show the effectiveness of the proposed method.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Design of a Static Anti-Windup Compensator which Guarantees Robust Stability

twitter
facebook
mendeley

Bibtex

Ris

Design of Nonlinear Robust Servosystems by Using LMIs

Yuzo OHTA, Izumi MASUBUCHI

pp. 671-679

DOI:

10.5687/iscie.12.671

Abstract

In this paper, we consider a design problem of robust nonlinear servosystems which can achieve asymptotic tracking for constant reference inputs. The problem setting in this paper is a little bit different from the usual one. We suppose that the reference input will change from r to r* at time t = 0 and that the initial state of the system is located in a neighborhood of the equilibrium corresponding to the reference input r. Under this setting, we consider a design problem of robust nonlinear servosystems : we consider an augment system including the integrator, design a state feedback gain for the augment system using LMI, and give an input r (t) interpolating r and r* so that the state moves the prescribed regions depending r (t) and consequently the output converges to r*.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Design of Nonlinear Robust Servosystems by Using LMIs

twitter
facebook
mendeley

Bibtex

Ris

The Neural Networks Realization of Quasi-Gradient System to Search for Equilibrium Solutions in Game Theory and Their Dynamical Behavior

Ryota HORIE, Eitaro AIYOSHI, Kippei MIYANO

pp. 680-690

DOI:

10.5687/iscie.12.680

Abstract

Mutually coupled plural Neural Networks (N.N.) modules are proposed from the view point of noncooperative game theory. First, new dynamical models, which is called “Quasi-Gradient System”, to search the Nash Equilibrium (NE) points under [0, 1] -interval or nonnegative constraints are proposed. The stability of the proposed searching models is analyzed by the linearization approach. In addition, relations between the Lotka-Volterra's ecological model or the population genetics model and the proposed searching models are indicated. Second, new mutually coupled plural N.N. modules are introduced to realize the proposed searching model for problems with quadratic objective functions. the asymmetric Hopfield type N.N. can be regarded as a special class of the proposed N.N. modules. Last, by simulations for simple problems, the biffurcations in dynamical behavior such as converging to different NE points, cyclic state transition with no NE points and other exceptional cases are shown.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

The Neural Networks Realization of Quasi-Gradient System to Search for Equilibrium Solutions in Game Theory and Their Dynamical Behavior

twitter
facebook
mendeley

Bibtex

Ris

Article Access Ranking

15 Jun. (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.