Search Sites

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

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

A Heuristic Algorithm Using Variable Depth Neighborhood for the Input-Output Scheduling Problem in Automated Warehouses

Kazumiti NUMATA, Taishi HAMAKAWA

pp. 135-144

Abstract

In this paper, we propose a new heuristic algorithm for the Input-Output Scheduling Problem (IOSP) at large scale automated warehouses. The proposed method separates IOSP into two subproblems, the one is to arrange all given tasks into a good partition, and the other is to generate a good tour for each group. It searches the best grouping of tasks by variable depth neighborhood local search, generating the optimum tour for each test group by enumeration. The small group size in IOSP makes it possible to enumerate tours. The results of numerical experiments on the same instances that some existing method solved show that the proposed method well competes with existing one under the criterion that considers both schedule length and solution time.

Bookmark

Share it with SNS

Article Title

A Heuristic Algorithm Using Variable Depth Neighborhood for the Input-Output Scheduling Problem in Automated Warehouses

Stochastic Ellipsoid Methods with Multiple Cuts

Takayuki WADA, Yasumasa FUJISAKI

pp. 145-150

Abstract

A stochastic ellipsoid method with multiple cuts is proposed for a class of robust feasibility problems which is to find a solution satisfying a set of parameter-dependent convex constraints for all possible parameter values. In particular, a new update rule is presented for constructing a smaller ellipsoid which contains the intersection of a previous ellipsoid and strips determined by given multiple gradients. A quantitative analysis of the volume of the updated ellipsoid is also provided, which leads to a further modification of the algorithm achieving fast convergence.

Bookmark

Share it with SNS

Article Title

Stochastic Ellipsoid Methods with Multiple Cuts

A Solution Method for Pole Placement and Stability Radius Enlargement Problem

Keishi KAWABATA, Takehiro MORI

pp. 151-158

Abstract

This paper presents a robust controller design method for linear time-invariant SISO systems based on an optimization approach. The task is to enlarge real stability radius to counter plant parameter perturbations by using extra degree of freedom of the controller parameters in the pole placement scheme. The formula for the real stability radius is known as an infimum of a certain function and that makes its gradients discontinuous. It is shown that by some manipulations, the considered problem can be converted to a nonlinear optimization problem, to which a gradient-based optimization method becomes applicable. The case of complex stability radius is also considered, which is less sharp as a robust stability index than the real counterpart, but has a much simpler form. Numerical examples for both cases are presented to show that they actually work, and some comparisons are discussed, leading to a suggestion on the effective uses of these two stability radius computation methods.

Bookmark

Share it with SNS

Article Title

A Solution Method for Pole Placement and Stability Radius Enlargement Problem

A Blocking Zero Placement Method by Dynamic State Feedback

Takashi TAKIMOTO, Shigeru YAMAMOTO

pp. 159-164

Abstract

In this paper, we consider a blocking zero placement problem for closed-loop systems by state feedback. As a solution to the problem, we derive a dynamic state feedback controller which can be designed by solving a stabilization problem by constant state feedback. Moreover, we apply the proposed blocking zero placement method to a periodic disturbance rejection problem. Since a transfer function with blocking zeros can eliminate input signals corresponding to these blocking zeros, the periodic disturbance can be rejected if closed-loop systems have corresponding blocking zeros with the period on the imaginary axis.

Bookmark

Share it with SNS

Article Title

A Blocking Zero Placement Method by Dynamic State Feedback

Article Access Ranking

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