All issues
Volume 21, Issue 2
Displaying 1-4 of 4 articles from this issue
- |<
- <
- 1
- >
- >|
-
A Case Study of Evolutionary Robotics ProblemsYoshiaki KATADA, Kazuhiro OHKURA2008 Volume 21 Issue 2 Pages 31-39
Published: February 15, 2008
Released on J-STAGE: October 13, 2011
JOURNAL FREE ACCESSNeutral networks, which occur in fitness landscapes containing neighboring points of equal fitness, have attracted much research interest in recent years. In our recent papers, we have shown that, in the case of simple test functions, the mutation rate of a genetic algorithm is an important factor for improving the speed at which a population moves along a neutral network. Our results also suggested that the benefits of the variable mutation rate strategy used by the operon-GA increase as the ruggedness of the landscapes increases. In this paper, we conducted a series of computer simulations with evolutionary robotics (ER) problems in order to investigate whether our previous results are applicable to this problem domain. The evolutionary dynamics we observed were consistent with those observed in our previous experiments, confirming that the variable mutation rate strategy is also beneficial to the ER problems.View full abstractDownload PDF (1416K) -
Hidekazu TAKAHARA, Kazumi HORIGUCHI2008 Volume 21 Issue 2 Pages 40-47
Published: February 15, 2008
Released on J-STAGE: October 13, 2011
JOURNAL FREE ACCESSIn this paper, we propose a model reduction method by truncation of the balanced realization associated with the sine-wave response observability gramian and the controllability gramian. A feature of the present model reduction method is that the transfer function's value of the reduced-order model is equal to that of the original model at some frequency points. This method is also shown to provide the reduced-order model which minimizes an error norm of the model reduction.View full abstractDownload PDF (942K) -
Akira MURAKAMI, Makishi NAKAYAMA, Mitsuo OKAMOTO, Kenichi SANO2008 Volume 21 Issue 2 Pages 48-59
Published: February 15, 2008
Released on J-STAGE: October 13, 2011
JOURNAL FREE ACCESSPass schedules for a tandem cold mill have been optimized using the chance constrained programming method. Variations of variables are evaluated from past data without assuming probability distributions. Discrete constraints are smoothed with the sigmoid functions, and the sequential quadratic programming method is applied. Furthermore, the constraints are relaxed individually on a priority basis so that a feasible and practical solution is obtained. Experimental results with high tensile strength steel strips showed 13 to 35% decreases in off-gage length.View full abstractDownload PDF (1731K) -
Hiroyuki KANO, Hiroyuki FUJIOKA2008 Volume 21 Issue 2 Pages 60-68
Published: February 15, 2008
Released on J-STAGE: October 13, 2011
JOURNAL FREE ACCESSWe consider the problem of designing optimal smoothing spline curves by employing an approach based on linear control systems. First, the problem is formulated using continuous-time, time-invariant systems with piecewise constant inputs. Then by introducing discrete time-varying systems, the solutions for optimal splines including periodic splines are derived. The existence conditions for unique optimal solutions are established and linked to the concepts of controllability and observability. The computational procedures for the optimal splines are straightforward. The design method for periodic splines is applied to a shape synthesizing problem using jellyfish as the example.View full abstractDownload PDF (1193K)
- |<
- <
- 1
- >
- >|