Paper
9 January 2008 BMI optimization by using parallel UNDX real-coded genetic algorithm with Beowulf cluster
Masaya Handa, Michihiro Kawanishi, Hiroshi Kanki
Author Affiliations +
Proceedings Volume 6794, ICMIT 2007: Mechatronics, MEMS, and Smart Materials; 67940T (2008) https://doi.org/10.1117/12.784340
Event: ICMIT 2007: Mechatronics, MEMS, and Smart Materials, 2007, Gifu, Japan
Abstract
This paper deals with the global optimization algorithm of the Bilinear Matrix Inequalities (BMIs) based on the Unimodal Normal Distribution Crossover (UNDX) GA. First, analyzing the structure of the BMIs, the existence of the typical difficult structures is confirmed. Then, in order to improve the performance of algorithm, based on results of the problem structures analysis and consideration of BMIs characteristic properties, we proposed the algorithm using primary search direction with relaxed Linear Matrix Inequality (LMI) convex estimation. Moreover, in these algorithms, we propose two types of evaluation methods for GA individuals based on LMI calculation considering BMI characteristic properties more. In addition, in order to reduce computational time, we proposed parallelization of RCGA algorithm, Master-Worker paradigm with cluster computing technique.
© (2008) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Masaya Handa, Michihiro Kawanishi, and Hiroshi Kanki "BMI optimization by using parallel UNDX real-coded genetic algorithm with Beowulf cluster", Proc. SPIE 6794, ICMIT 2007: Mechatronics, MEMS, and Smart Materials, 67940T (9 January 2008); https://doi.org/10.1117/12.784340
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Brain-machine interfaces

Optimization (mathematics)

Genetic algorithms

Chemical elements

Control systems design

Statistical analysis

Feedback control

Back to Top