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. 29 (2016), 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. 29 (2016), No. 8

Health Monitoring for Jet Engines using Robust Filter based on Nonlinear Model

Yuichi Wakabayashi, Daiki Kakiuchi, Moe Kinoshita, Keiko Nakamura, Mai Kimura, Ryo Sato, Masahiro Ono, Shuichi Adachi

pp. 337-345

DOI:

10.5687/iscie.29.337

Abstract

We develop a novel jet engine health monitoring method using a high-fidelity, physics-based simulation model. In jet engine health monitoring, fault detection with a state estimation is frequently carried out. However, a challenge for a filtering-based health monitoring method with a high-fidelity model is the difficulty to analytically obtain the Jacobians, which is required for the extended Kalman filter. Our approach is to derive a linearized model a priori at a fixed operation point, and use a robust filter method to guarantee a reliable health monitoring over a wide range of operation points despite the linearization errors. We validate the proposed method by extensive simulations.

Readers Who Read This Article Also Read

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Health Monitoring for Jet Engines using Robust Filter based on Nonlinear Model

twitter
facebook
mendeley

Bibtex

Ris

Reinforcement Learning of Shared Control Policies for Dexterous Telemanipulation

Takahiro Hasegawa, Takamitsu Matsubara, Kenji Sugimoto

pp. 346-354

DOI:

10.5687/iscie.29.346

Abstract

Recently, the framework of shared control between a human operator and a robot system using a cooperative controller with human operator to decide control input to a robot system has been drawing much attention for dexterous telemanipulation. However, desiging a suitable controller for shared control scheme for the given task is difficult due to the difficulties in modeling of operator'’s behavior and environment. In this paper，we proposed a model-free approach using reinforcement learning to learn a shared control policy through interactions with the operator, robot and environment. To validate our method，we adopted a page turning task by telemanipulation and developed an experimental platform with a physical simulator．Experimental results suggest that our method is able to learn task-relevant shared control for flexible and enhanced dexterous manipulation．

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Reinforcement Learning of Shared Control Policies for Dexterous Telemanipulation

twitter
facebook
mendeley

Bibtex

Ris

Study of Improving Leg Detection with Implementing Leg Model for Wearable Floor Interaction Input/Output Interface

Fumihiro Sato, Tomu Tominaga, Yoshinori Hijikata, Nobuchika Sakata, Shogo Nishida

pp. 355-361

DOI:

10.5687/iscie.29.355

Abstract

Our previous study designed interactive floor projection system with hands and toes input in terms of quick and light input system. This system lets user interact with floor projection by pointing the finger or stepping on projection image. It allows to realize floor interaction without using even a single hands.However, in this system, it is difficult for user to input by toes to desired position precisely because of low accuracy of toe detection. In this paper, we propose a new toe detection method by means of implementing a leg model to improve the accuracy of toe detection. The model signifies human leg. It consists of three joints and; thigh, cnemis and foot length. Moreover, we conduct user study to investigate accuracy of toe detection compared with proposed and previous method. As a result, proposed method can detect toe position with higher accuracy than previous method.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Study of Improving Leg Detection with Implementing Leg Model for Wearable Floor Interaction Input/Output Interface

twitter
facebook
mendeley

Bibtex

Ris

An Identication Method for Multiple-Input Multiple-Output Linear Systems with Estimation of Variance of Input-Output Noises

Nobuo Komatsu

pp. 362-371

DOI:

10.5687/iscie.29.362

Abstract

A new algorithm is proposed to estimate parameters of MIMO (Multiple-Input Multiple-Output) system. The algorithm is an expansion of the previously proposed algorithm by the author for SISO (Single-Input Single-Output) system and MISO (Multiple-Input Single-Output) system. Those algorithms use an iterative calculation and they consist of two parts. One part is the estimation of the system parameters using the variances of errors. The other part is the estimation of the variances of errors using the system parameters. The estimation of the system parameters is one of the least squares identification algorithms using eigenvector. The variances of errors are estimated by solving linear simultaneous equations derived from the transfer functions of the system. Some simulations show the effectiveness of the proposed method.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

An Identication Method for Multiple-Input Multiple-Output Linear Systems with Estimation of Variance of Input-Output Noises

twitter
facebook
mendeley

Bibtex

Ris

Recognizing Housework and Figuring Out Its Conscientious Degree from One-Dimensional Brightness

Shota Shimayoshi, Shun Okamura, Yusuke Kajiwara, Hiromitsu Shimakawa

pp. 372-381

DOI:

10.5687/iscie.29.372

Abstract

The lack of helpers in facilities to take care of the elderly has become a serious problem in Japan,because of the rapid increase of the elderly. It is necessary for the elderly living alone to keep their living willingness enough to stay in a status free from case. The method uses the brightness distribution sensors to collect movement logs in order to protect the privacy of the elderly. The brightness distribution acquired by the sensors brings information significant enough for a machine to discern living activities. This study figures out the conscientious degree with the difference of the body trunk movement of the person carrying out of the living activities. In an experiment for the elderly, the f-measure with which the method has recognized activities of cleaning, cooking,and washing are 0.975, 0.912, and 0.927, respectively. The experiment shows 0.599, which indicates conscientious degree of cleaning. It justifies the proposed method uses the movement of body trunk to figuring out the conscientious degree.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Recognizing Housework and Figuring Out Its Conscientious Degree from One-Dimensional Brightness

twitter
facebook
mendeley

Bibtex

Ris

Leader-following Formation Navigation with Virtual Trajectories for Dynamic Multi-agents

Manabu Suzuki, Ryo Kobayashi, Kazushi Nakano, Tetsuro Funato, Yoshihiro Matsui

pp. 382-389

DOI:

10.5687/iscie.29.382

Abstract

In recent years, cooperative control of multi-agents, especially formation control, has attracted considerable interest among control engineers. As one of the formation control methods, we deal with the leader-following formation navigation (LFFN). The LFFN is defined such that a human operator or an autonomous leader agent forms a queue of agents to guide multiple followers. The followers pass along the leader'’s trajectory with the same motion as the leader. When the leader passes along a safe route to avoid obstacles, the followers also pass along a similar safe trajectory. However, when using the LFFN, the followers can shape only a single column formation.
In this study, we first extend the above LFFN'’s usage to parallel single columns using adjoining virtual leaders. Next, we consider virtual leaders adjoining the leader to design virtual trajectories along which virtual leaders passed and virtual leader'’s velocities on their path. We design the followers'’ target points which track the virtual leader’s path with designed virtual velocity. Using our proposed method, the followers shape a formation which is not a single column but a multiple column type. Finally, we demonstrate the effectiveness of our newly proposed method through simulation and experimentation.

Readers Who Read This Article Also Read

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Leader-following Formation Navigation with Virtual Trajectories for Dynamic Multi-agents

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.