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. 32 (2019), No. 4

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

29 Apr. (Last 30 Days)

Transactions of the Institute of Systems, Control and Information Engineers Vol. 32 (2019), No. 4

On the Use of Reachable Set for Safe Operation in Microgrid

Nodoka Asayama, Takashi Hikihara

pp. 137-144

DOI:

10.5687/iscie.32.137

Abstract

Microgrid is one of the new power supply systems expected for expanding introduction of renewable energy and improving the power quality. However, generators in a microgrid have risk at step-out because a microgrid utilizes many changeable power resources. For a safe operation in a microgrid, we evaluate reachable sets for unsafe sets of gas-engine generators according to a microgrid model. Reachable sets have already been applied to a study on air traffic management and electric power system. The unsafe sets are defined to avoid large deviations of rotor speed. Setting plurality of unsafe set, system’s safe set can be obtained by calculating backward reachable sets for unsafe sets. This paper considers two compensation operations for load fluctuation. Based on the characteristic of reachable sets for unsafe sets, demand response strategy can be examined. Finally, numerical simulation shows that setting based on reachable sets can suppress the angular frequency variation of gas-engine generators in microgrid.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

On the Use of Reachable Set for Safe Operation in Microgrid

twitter
facebook
mendeley

Bibtex

Ris

Approximation of Cumulative Distribution Functions Based on L∞and L1 Norms for Stochastic Systems Control

Yohei Hosoe, Masaya Okuno, Tomomichi Hagiwara

pp. 145-153

DOI:

10.5687/iscie.32.145

Abstract

This paper studies approximation of probabilistic distributions behind discrete-time linear systems with stochastic dynamics for advances in control of the systems. We discuss two approximation methods leading to optimal discrete distributions whose errors from the probabilistic distribution behind the system are minimal in the sense of the L∞ and L1 norms of the differences between associated cumulative distribution functions. The effectiveness of those approximation methods is demonstrated with numerical examples, in which the methods are compared with another simple method of constructing discrete distributions based on random sampling.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Approximation of Cumulative Distribution Functions Based on L∞and L1 Norms for Stochastic Systems Control

twitter
facebook
mendeley

Bibtex

Ris

Mining of Behavioral Motifs from Individual Ant Trajectory

Kazutaka Shoji, Naohisa Nagaya, Ryusuke Fujisawa

pp. 154-158

DOI:

10.5687/iscie.32.154

Abstract

Complex biological systems resemble a “black box,” as it is a priori unclear how interactions among individuals will affect the collective (group) behavioral performance. Network analysis is a suitable method to shed light on these black boxes by studying the collective behavior of highly integrated social organisms such as ants. Individual within the colony have their own personality and task allocation for sustaining the society. Individual-level data are also important for understanding network structure. To obtain individual-level data such as personality and task allocation, individual behavior was assessed using several well-established information processing methods. To detect individual personalities from the position data, trajectory patterns were used. To analyze trajectory patterns, behavioral motif detection was used. The behavioral motif is the minimum unit of the entire trajectory.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Mining of Behavioral Motifs from Individual Ant Trajectory

twitter
facebook
mendeley

Bibtex

Ris

Particle Filter without a Prior Information for Probability Distribution

Yasuaki Kaneda, Yasuharu Irizuki

pp. 159-167

DOI:

10.5687/iscie.32.159

Abstract

Kalman filter is one of the most famous state estimation methods. Many state estimations based on Kalman filter have been proposed for various conditions of systems and noise. These estimation methods need to know probability density functions of dynamical systems. However, the probability density functions and a prior information of noise in particular are rarely known in practice. On the other hand, in the field of machine learning, probability density estimations have been studied extensively, and conditional probability density estimations were proposed as extensions of the probability density estimations. In this paper, we propose a direct design method of probability density functions for dynamical systems from data by using conditional probability density estimations because the systems are represented as conditional probability density functions. In addition, we apply the method to particle filter, which is one of nonlinear Kalman filters, and propose a new state estimation method without a prior knowledge for the dynamical systems. Numerical simulations demonstrate the effectiveness of the proposed method.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Particle Filter without a Prior Information for Probability Distribution

twitter
facebook
mendeley

Bibtex

Ris

Nonlinear Model Predictive Control of Position and Attitude in a Hexacopter with Two Failed Rotors

Yusuke Aoki, Yuta Asano, Akihiko Honda, Norizumi Motooka, Toshiyuki Ohtsuka

pp. 168-176

DOI:

10.5687/iscie.32.168

Abstract

We consider nonlinear model predictive control (NMPC) for an unmanned aerial vehicle (a hexacopter) with two of its six rotors failed. We consider three cases of failures: failure of two rotors in diagonal position, failure of two rotors separated by a functioning rotor, and failure of two adjacent rotors. Simulation results show that, by applying NMPC, the position and attitude of the hexacopter can be controlled from an initial state significantly deviated from an equilibrium state.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Nonlinear Model Predictive Control of Position and Attitude in a Hexacopter with Two Failed Rotors

twitter
facebook
mendeley

Bibtex

Ris

Feedback Error Learning Control under an SPR Condition with Application to Temporal Sensing Failure

Wataru Imahayashi, Kenji Sugimoto

pp. 177-184

DOI:

10.5687/iscie.32.177

Abstract

Feedback error learning (FEL) control attains accurate response to a target signal by tuning parameters in feedforward (FF) controller, provided that feedback (FB) control stabilizes the closed-loop in two-degree-of-freedom structure. It has been shown under a certain strictly positive real (SPR) condition that the output error converges to zero for any target signals. In this paper we propose a somewhat different parameter tuning law from a conventional one and give a proof for convergence. We also apply the proposed method to temporal sensing failure. It is known that in networked control the sensing signal may be lost from time to time due to congestion in communication channels. Such temporal sensing failure also happens due to occlusion of non-contact sensors. In this paper, we show that our FEL control scheme is effective for such sensing failure through numerical simulation.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Feedback Error Learning Control under an SPR Condition with Application to Temporal Sensing Failure

twitter
facebook
mendeley

Bibtex

Ris

Article Access Ranking

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