All issues
Volume 18, Issue 11
Displaying 1-6 of 6 articles from this issue
- |<
- <
- 1
- >
- >|
-
Takashi MIYAZAKI, Shigeyuki HOSOE2005 Volume 18 Issue 11 Pages 377-385
Published: November 15, 2005
Released on J-STAGE: October 13, 2011
JOURNAL FREE ACCESSIn this paper we consider sliding mode control for descriptor systems. We propose a control input that bring and constrain the trajectory to a switching hyper plane and a design method of the hyper plane. We reduce this design problem to a stabilizing problem of a descriptor system. This stabilizing problem is solved by a generalized algebraic Riccati equation that has a kind of optimality. We also provide a computation method by considering a generalized eigenvalue problemView full abstractDownload PDF (936K) -
Tatsuya KOBAYASHI, Kazumiti NUMATA2005 Volume 18 Issue 11 Pages 386-392
Published: November 15, 2005
Released on J-STAGE: October 13, 2011
JOURNAL FREE ACCESSIn this paper we address a piston delivery scheduling problem with time-window constraints. The feature of this problem is a piston delivery. In a piston delivery, total running cost (length) to deliver products to all customers doesn't change even if we use a lot of or a few trucks. But the number of trucks necessary to satisfy time-window constraints is varied by the delivery timing. One of main factors of the delivery cost is the number of trucks to be secured. The minimum (or near minimum) number of trucks necessary for a given delivery request is a matter of interest. We propose a new solution method using Lagrangian relaxation for this problem. Numerical experiments show that the proposed method produces solutions with 25-20% less trucks than those by simple heuristics.View full abstractDownload PDF (1241K) -
Osamu KANEKO, Paolo RAPISARDA, Kiyotsugu TAKABA2005 Volume 18 Issue 11 Pages 393-399
Published: November 15, 2005
Released on J-STAGE: October 13, 2011
JOURNAL FREE ACCESSIn this paper, we address an algorithm for the spectral factorization of para-Hermitian unimodular polynomial matrices in the continuous time case. Most of the algorithms for the spectral factorizations of matrix polynomials depend on the existence of the roots of given polynomial matrices, so it is almost impossible to execute the spectral factorization of unimodular polynomial matrices. In this paper, we provide a new algorithm for the spectral factorization of unimodular polynomial matrices without the existence of the roots of polynomial matrices or the stability. The task one has to do is only to solve a linear matrix inequality consisting of the coefficients of a given unimodular matrix, which can be achieved easily by the use of numerical computation packages. The algorithm we present here is based on the property of the storage functions for the dissipative systems in which there always exists positive dissipated energy for the environment. This implies that the fundamental property in our algorithm is also a self-standing interesting result with respect to theoretical points of view. Finally, in order to show the validity of our results, we give an illustrative example with respect to numerical aspects.View full abstractDownload PDF (1170K) -
An Extension of Fictitious Reference Iterative TuningOsamu KANEKO, Kyoko YOSHIDA, Kazuyuki MATSUMOTO, Takao FUJII2005 Volume 18 Issue 11 Pages 400-409
Published: November 15, 2005
Released on J-STAGE: October 13, 2011
JOURNAL FREE ACCESSRecently, for the purpose of the minimization of the squared error between the desired and real experimental output of the plant, Iterative Feedback Tuning (IFT), Virtual Reference Feedback Tuning (VRFT), and Fictitous Reference Iterative Tuning (FRIT) were proposed as reasonable methods for tuning of the parameters of controllers. The first one requires many experiments for the updating step in Gauss-Newton method, while the later two methods requires only one-shot experimental data. Moreover, VRFT and FRIT have useful features in a complementary manner. From these backgrounds, this paper provides a new parameter tuning for controllers based on least-squares optimization by using one-shot closed loop experimental data. Here, we provide a basic idea of this approach and discuss the optimality of the obtained parameter. Moreover, we introduce the pre-filter so as to guarantee that the optimized parameter in the fictitious area corresponds to that in the real area. We also provide the algorithm of our method for enhancement of the use of this procedure. Finally we give an experimental example to illustrate the validity of our results.View full abstractDownload PDF (1417K) -
Kentaro KAMEYAMA, Akira OHSUMI2005 Volume 18 Issue 11 Pages 410-419
Published: November 15, 2005
Released on J-STAGE: October 13, 2011
JOURNAL FREE ACCESSIn this paper, a prediction method is newly proposed for time-varying stochastic linear systems in the subspace identification framework. The key to this subspace-based prediction is to regard the change of the extended observability matrix yielded by the time-varying parameters of system as the rotation of the principal vectors that span the basis of the signal subspace. The rotation rate is evaluated from the angle between the past and current signal subspaces, and the future signal subspace is predicted by rotating the current subspace. A recursive algorithm is derived and its efficacy is tested by simulation experiments.View full abstractDownload PDF (1251K) -
Takafumi NAGANO, Takashi IWAMOTO2005 Volume 18 Issue 11 Pages 420-422
Published: November 15, 2005
Released on J-STAGE: October 13, 2011
JOURNAL FREE ACCESSDownload PDF (355K)
- |<
- <
- 1
- >
- >|