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. 20 (2007), No. 3

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. 20 (2007), No. 3

Stepping Over Excess of Obstacle for Biped Robot Based on Hybrid Control

Daisuke KUSHIDA, Fumiaki TAKEMORI, Akira KITAMURA

pp. 91-97

DOI:

10.5687/iscie.20.91

Abstract

In this research, it paid attention to that system of stepping over the obstacle by biped robot same as HDS, where continuous and discrete event exist together. And it was made to return to optimal control problem after it had expressed by MLDS in consideration of various constraint conditions. In a general ZMP control, because it is necessary to consider the constraint condition and the optimality separately, it complicates by coexistence of two or more control theories. On the other hand, the stepping over excess of the obstacle with biped robot based on the hybrid control can systematically achieve optimum control because it can treat them in the same way. In this paper, it was shown that the stepping over excess of the obstacle with biped robot was able to return in optimal control problem, and the effect was confirmed by the simulation work.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Stepping Over Excess of Obstacle for Biped Robot Based on Hybrid Control

twitter
facebook
mendeley

Bibtex

Ris

A 3D Measurement based on Geometric Constraint of Hand-Sweep Light Striping

Tadashi HYUGA, Kosuke SATO

pp. 98-105

DOI:

10.5687/iscie.20.98

Abstract

We propose a new method for measuring the entire surfaces of a 3D object by light stripe range finding. Most of light striping measurements assume that the positions of a camera and light sources are calibrated previously. The propose method can utilize not known positions of light sources but unconstraint free wands. In the case of plural parallel planes, there is a geometric constraint between the plane generated by the freehand light stripe and the intersected points with the parallel light stripes, so that the 3D geometry of the freehand light source can be determined analytically. Once hand-sweeping the slit light source over the object, we can obtain the entire 3D shapes of the object. It can expand the variety of applications on shape measurements.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A 3D Measurement based on Geometric Constraint of Hand-Sweep Light Striping

twitter
facebook
mendeley

Bibtex

Ris

An Application of Genetic Algorithm for Facility Location Problem with A-distance in a Competitive Environment

Takeshi UNO, Masatoshi SAKAWA, Kosuke KATO, Hideki KATAGIRI, Kazutaka CHO

pp. 106-113

DOI:

10.5687/iscie.20.106

Abstract

About studies of optimal location problem with competitiveness to other facilities, the distance between facilities and their customers is usually represented as Euclid distance. However, there are often cases that facility location given for facility location model with Euclid distance does not suit the actual condition of facility location in city area. In this paper, we suggest a new location model by introducing A-distance, proposed by Widmayer etc., which is the distance that directions that customers can move is limited. Because the formulated optimal location problem is difficult to solve immediately, we reformulate the problem to combinational problem to find one of the optimal solutions for the problem. The reformulated problem can be solved strictly, but it requires enormous computational time and costs for large scale problems. We construct an efficient solving method by applying genetic algorithm for non-linear 0-1 programming problem. Moreover, we show efficiency of the algorithm by using some numerical examples.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

An Application of Genetic Algorithm for Facility Location Problem with A-distance in a Competitive Environment

twitter
facebook
mendeley

Bibtex

Ris

High-Speed Object Tracking System using Active Camera

Hiroshi OIKE, Haiyuan WU, Chunsheng HUA, Toshikazu WADA

pp. 114-121

DOI:

10.5687/iscie.20.114

Abstract

This paper presents a new method for tracking the moving target by controlling a pan-tilt camera. Our method can capture motion-blur-free images of a moving target, because this method automatically synchronizes the target motion with the camera motion. We employed Fixed Viewpoint Pan Tilt Camera (FV-PTZ Camera) as an active camera, which does not produce motion parallax by the camera rotation. For the target tracking on image space, we use K-means Tracker algorithm. As for the pan-tilt control, we employ the PID control scheme. This is because if by assigning the P component as the angular velocity of the object, the I and D components can be corresponded to the angular position and the angular acceleration, respectively. This means the PID control is suitable for controlling the angular speed and position of the pan-tilt unit simultaneously. PID based pan-tilt control is effective for the motion synchronization between the target and camera.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

High-Speed Object Tracking System using Active Camera

twitter
facebook
mendeley

Bibtex

Ris

Synthesis of Optimal Dynamic Quantizers for Symbolic Input Control

Shun-ichi AZUMA, Toshiharu SUGIE

pp. 122-129

DOI:

10.5687/iscie.20.122

Abstract

This paper presents an optimal dynamic quantizer synthesis for controlling linear time-invariant systems by the discrete-valued input. The quantizers considered here are in the form of a difference equation, for which we find a quantizer such that the system composed of a given linear plant and the quantizer is an optimal approximation of the given linear plant in the sense of the input-output relation. First, we derive a closed form expression for the performance of the dynamic quantizers in control systems. Next, based on this, an optimal dynamic quantizer and its performance, corresponding to the performance limitation of the dynamic quantizers, are provided. Finally, the relation among the optimal dynamic quantizer and the existing quantizers, the receding horizon quantizers and the ΔΣ modulators, is discussed.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Synthesis of Optimal Dynamic Quantizers for Symbolic Input Control

twitter
facebook
mendeley

Bibtex

Ris

Representation of Disease Diagnosis Knowledge and Construction of Effective Diagnostic Procedure

Akio GOFUKU, Akira YAMASAKI, Kazuhiko MITSUOKA, Hiroyuki HASHIZUME

pp. 130-132

DOI:

10.5687/iscie.20.130
mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Representation of Disease Diagnosis Knowledge and Construction of Effective Diagnostic Procedure

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.