Search Sites

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

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)

  2. Vol. 36 (2023)

  3. Vol. 35 (2022)

  4. Vol. 34 (2021)

  5. Vol. 33 (2020)

  6. Vol. 32 (2019)

  7. Vol. 31 (2018)

  8. Vol. 30 (2017)

  9. Vol. 29 (2016)

  10. Vol. 28 (2015)

  11. Vol. 27 (2014)

  12. Vol. 26 (2013)

  13. Vol. 25 (2012)

  14. Vol. 24 (2011)

  15. Vol. 23 (2010)

  16. Vol. 22 (2009)

  17. Vol. 21 (2008)

  18. Vol. 20 (2007)

  19. Vol. 19 (2006)

  20. Vol. 18 (2005)

  21. Vol. 17 (2004)

  22. Vol. 16 (2003)

  23. Vol. 15 (2002)

  24. Vol. 14 (2001)

  25. Vol. 13 (2000)

  26. Vol. 12 (1999)

  27. Vol. 11 (1998)

  28. Vol. 10 (1997)

  29. Vol. 9 (1996)

  30. Vol. 8 (1995)

  31. Vol. 7 (1994)

  32. Vol. 6 (1993)

  33. Vol. 5 (1992)

  34. Vol. 4 (1991)

  35. Vol. 3 (1990)

  36. Vol. 2 (1989)

  37. Vol. 1 (1988)

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

On Reachability and Observability of a Plug-Flow Reactor Equation

Hideki SANO

pp. 457-464

Abstract

This paper is concerned with the problems of reachability and observability of a plug-flow reactor equation. It is shown that the system with boundary inputs is formulated as an well-defined boundary control system, and that it is reachable through a concrete expression of the solution. In addition, the reachable subspace is characterized for the case where only one boundary input is added to the system. Furthermore, the results concerning observability are derived through a concrete expression of the solution to the dual system of the plug-flow reactor equation with the output equation.

Bookmark

Share it with SNS

Article Title

On Reachability and Observability of a Plug-Flow Reactor Equation

A Decomposition Method for Production Scheduling and AGV Routing Problems by Lagrangian Relaxation with Cut Generation

Yuichiro HIRANAKA, Tatsushi NISHI, Masahiro INUIGUCHI

pp. 465-474

Abstract

In this paper, we propose a decompositon method for simultanenous optimization problem of production scheduling and transportation routing for semiconductor fabrication bays. The original problem is decomposed into an upper level subproblem to determine production scheduling and assignment of requests to AGVs and a lower level subproblem to derive a collision-free routing for AGVs. The novel idea of the proposed method is that the upper level subproblem is solved by using Lagrangian relaxation technique incorporating cuts generated from a solution of the lower level subproblem. The algorithm solves successively the upper level problem and the lower level problem until a feasible solution for original problem is derived. The entire search space is reduced by incorporating cuts. The effectiveness of the proposed method is investigated from numerical experiments.

Bookmark

Share it with SNS

Article Title

A Decomposition Method for Production Scheduling and AGV Routing Problems by Lagrangian Relaxation with Cut Generation

Feedback Error Learning for Writing One Stroke Characters by Two-Link Manipulator

Basel ALALI, Kentaro HIRATA, Kenji SUGIMOTO

pp. 475-481

Abstract

In this paper, we consider a version of problem how to teach robots to write characters in actual environment. In particular, one must design a feedforward controller for two-link manipulators to improve the tracking performance in the face of limited knowledge of the surroundings. We employ an adaptive scheme, called MIMO-FEL (Multi-Input Multi-Output Feedback Error Learning) to achieve our objective. The effectiveness of proposed method is demonstrated with an experiment.

Bookmark

Share it with SNS

Article Title

Feedback Error Learning for Writing One Stroke Characters by Two-Link Manipulator

Text Mining and Visualization for Numerical Information from a Large Number of Documents

Masaki MURATA, Koji ICHII, Qing MA, Tamotsu SHIRADO, Toshiyuki KANAMARU, Sachiyo TSUKAWAKI, Hitoshi ISAHARA

pp. 482-484

Bookmark

Share it with SNS

Article Title

Text Mining and Visualization for Numerical Information from a Large Number of Documents

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.