Search Sites

Transactions of the Institute of Systems, Control and Information Engineers Vol. 21 (2008), No. 7

ISIJ International
belloff
ONLINE ISSN: 2185-811X
PRINT ISSN: 1342-5668
Publisher: THE INSTITUTE OF SYSTEMS, CONTROL AND INFORMATION ENGINEERS (ISCIE)

Backnumber

  1. Vol. 36 (2023)

  2. Vol. 35 (2022)

  3. Vol. 34 (2021)

  4. Vol. 33 (2020)

  5. Vol. 32 (2019)

  6. Vol. 31 (2018)

  7. Vol. 30 (2017)

  8. Vol. 29 (2016)

  9. Vol. 28 (2015)

  10. Vol. 27 (2014)

  11. Vol. 26 (2013)

  12. Vol. 25 (2012)

  13. Vol. 24 (2011)

  14. Vol. 23 (2010)

  15. Vol. 22 (2009)

  16. Vol. 21 (2008)

  17. Vol. 20 (2007)

  18. Vol. 19 (2006)

  19. Vol. 18 (2005)

  20. Vol. 17 (2004)

  21. Vol. 16 (2003)

  22. Vol. 15 (2002)

  23. Vol. 14 (2001)

  24. Vol. 13 (2000)

  25. Vol. 12 (1999)

  26. Vol. 11 (1998)

  27. Vol. 10 (1997)

  28. Vol. 9 (1996)

  29. Vol. 8 (1995)

  30. Vol. 7 (1994)

  31. Vol. 6 (1993)

  32. Vol. 5 (1992)

  33. Vol. 4 (1991)

  34. Vol. 3 (1990)

  35. Vol. 2 (1989)

  36. Vol. 1 (1988)

Transactions of the Institute of Systems, Control and Information Engineers Vol. 21 (2008), No. 7

Optimal Design of Cogeneration Systems by Mathematical Programming

Yoichi TANAKA, Masao FUKUSHIMA

pp. 201-210

Abstract

Cogeneration systems (CGSs) consist of power generators and thermally activated machines used to recover the thermal energy from the generators. The CGS optimal design problem is an optimal location problem of facilities that produce energy through two stages. Electric power and thermal energy are produced in the first stage and thermal energy is converted to effective energy in the second stage. An allocation of facilities is evaluated as the sum of the initial cost associated with the equipping of facilities and the minimum running cost entailed in satisfying the energy demand. Therefore, the CGS optimal design problem is a difficult problem that is composed of an optimal location problem and an optimal scheduling problem. In this paper, we present a mixed integer programming (MIP) formulation of the CGS optimal design problem. The proposed formulation enables us to use a general purpose MIP solver that is readily available. We show that realistic CGS optimal design problems arising in a hospital, a hotel and an office can be solved with reasonable computational costs.

Bookmark

Share it with SNS

Article Title

Optimal Design of Cogeneration Systems by Mathematical Programming

Synchronization of Multiple Plants over Networks via Switching Observer Using Time-stamp Information

Yukinori NAKAMURA, Kentaro HIRATA, Kenji SUGIMOTO

pp. 211-218

Abstract

This paper considers synchronization of multiple plants over networks. The effect of time-varying transmission delay is compensated by a switching observer which uses the time-stamp information. To calculate the instantaneous value of transmission delay length via the time-stamp, the clocks of sending and receiving computers must be synchronized. It is shown that the correction of the difference of the quartz frequencies of the computers and the clock adjustment via NTP (Network Time Protocol) can provide the time synchronization within a required accuracy for moderate sampling periods. Proposed method is demonstrated by an experiment of synchronization of DC-motors over a real network.

Bookmark

Share it with SNS

Article Title

Synchronization of Multiple Plants over Networks via Switching Observer Using Time-stamp Information

Shape Classification in Rotating Manipulation by Universal Robot Hand

Hiroyuki NAKAMOTO, Futoshi KOBAYASHI, Nobuaki IMAMURA, Hidenori SHIRASAWA, Fumio KOJIMA

pp. 219-225

Abstract

We propose a method of shape classification in rotating manipulation by a multi-fingered robot hand. A multi-fingered robot hand understands position and posture of a object and can realize suitable manipulations by classifying a shape of contact surface in rotating manipulation. Our method uses pressure distributed sensors equipped in fingers and consists of the following three processes. First, periodic pressure distributions are measured by a pressure distributed sensor in rotating manipulation. A kurtosis is calculated from each pressure distribution and can quantify a shape of contact surface in the moment. Secondly, a kurtosis pattern is cut out from a periodic kurtosis. Finally, a degree of similarity calculates between a kurtosis pattern and a reference pattern by DP matching method and classifies the shape of contact surface using thresholds. We confirm that our method classifies three objects with a high degree of accuracy and can keep the classification rate even in changing rotation velocity through laboratory experiments.

Bookmark

Share it with SNS

Article Title

Shape Classification in Rotating Manipulation by Universal Robot Hand

Path Teaching and Navigation of a Mobile Robot by Significant Point Images with Information of Locations

Hidenari MAKINO, Shigehiro YAMAMOTO, Teruo AZUKIZAWA, Takeshi HASHIMOTO

pp. 226-233

Abstract

This paper proposes a novel method to easily and effectively teach a mobile robot its path and to navigate it along the instructed path. First, an operator takes pictures at some significant points such as a start point, turning left/right points and a goal point at the teaching stage. At the same time, locations of these significant points are also obtained with a GPS receiver. Then, the operator teaches the robot its path by some simple instructions based on the pictures referred as reference images. Finally, at the autonomous navigation stage, the robot travels along the path with two navigation modes. One of them is landmark-based navigation, that is, the robot recognizes its headings and the significant points by detecting the landmarks indicated in the reference images when the robot is traveling near the significant points. Another mode is GPS-based navigation. The robot is navigated to near the significant points by GPS information when the robot is far from the significant points. Experiment conducted along a 620 meters long path indicates the effectiveness of the proposed method.

Bookmark

Share it with SNS

Article Title

Path Teaching and Navigation of a Mobile Robot by Significant Point Images with Information of Locations

Characterization of Easily Controllable Discrete-time Plants Based on Finite Frequency Phase/Gain Property

Masaaki KANNO, Shinji HARA, Shiro TAKAHARA

pp. 234-236

Bookmark

Share it with SNS

Article Title

Characterization of Easily Controllable Discrete-time Plants Based on Finite Frequency Phase/Gain Property

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.