• Aucun résultat trouvé

Optimization Material Distribution in Electromagnetic Actuators

N/A
N/A
Protected

Academic year: 2021

Partager "Optimization Material Distribution in Electromagnetic Actuators"

Copied!
3
0
0

Texte intégral

(1)

HAL Id: hal-00674682

https://hal.archives-ouvertes.fr/hal-00674682

Submitted on 27 Feb 2012

HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci- entific research documents, whether they are pub- lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

Optimization Material Distribution in Electromagnetic Actuators

Pierre-Emmanuel Cavarec, Hamid Ben Ahmed, Bernard Multon

To cite this version:

Pierre-Emmanuel Cavarec, Hamid Ben Ahmed, Bernard Multon. Optimization Material Distribution in Electromagnetic Actuators. 11th Internat. Symp. on Applied Electromagnetics and Mechanics 2003, May 2003, VERSAILLES, France. 2pp. �hal-00674682�

(2)

Optimization Material Distribution in Electromagnetic Actuators

P.E. CAVAREC, H. BEN AHMED, B. MULTON

SATIE (UMR CNRS-ENS Cachan) Britany branch, Campus de Ker Lann 35170 Bruz France Cavarec@bretagne.ens-cachan.fr

Abstract: In this paper, a new approach for Optimization Material Distribution is proposed. The principle behind this approach is to use a surface genetic algorithm in order to determine material distribution in a fixed Finite Element Computation mesh. The method proved to be very adaptive to various kinds of electromagnetic actuator optimizations. In the final paper, several optimal actuators will be presented.

1 Introduction

Optimization Material Distribution (OMD, or TOFEM) constitutes one of the most promising optimization techniques for electromagnetic applications [1]. The principle calls for considering a mesh fixed in space. The optimization algorithm is then required to select the material property of each element. The main advantage to this technique lies in the originality of the final solution, which does not depend on knowledge held by the designer.

In contrast, the main drawback is the computation time involved in conducting such an optimization sequence.

Two kinds of algorithms have already been proposed for this application:

- design sensitivity analysis (DSA), based on computing the sensitivity of each mesh element [2,3];

- the classical genetic algorithm (GA), which does not require any such computation [4].

In this paper, we will present several improvements made to the classical binary genetic algorithm for OMD-type problems, thereby giving rise to the "surface genetic algorithm".

2 Principles for applying the surface genetic algorithm

Genetic algorithm efficiency is heavily tied to data representations. In electromagnetic problems, The electromagnetic coupling between zones related to Maxwell equations is determining. In order to respect this detail, operations of mutation and crossover are done on elementary surfaces that correspond to neighboring matrixes bites as shown in the following figure:

0 0 0 1 0 1 0 0 1 0 0 1 0 0 0 0 1 0 1 0 1 1 1 0 0 0 1 0 0 0 1 1 0 0 1 1 1 1 0 0 0 1 0 0 0 0 0 1 0 1 1 0 1 0 1 1 1 0 1 1 0 1 1 1 1 1 1 0 0 0 1 0 0 0 1 0 1 0 0 1 0 0 1 0 0 0 1 0 1 0 0 1 0 1 1 1 1 0 0 0

1 0 0 1 0 1 0 0 1 0 0 1 0 0 0 0 1 0 1 0 1 1 1 0 0 0 1 0 1 1 1 0 1 0 1 1 1 0 1 1 0 1 1 1 1 1 1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 1 0 0 1 1 0 0 1 1 1 1 0 0 0 1 0 0 0 0 0 1 0 1 1 0 1 1 1 1 0 1 1 0 1 1 1 1 0

0 0 0 1 0 1 0 0 1 0 0 1 0 0 0 0 1 0 1 0 1 1 1 0 0 0 1 0 0 0 1 1 1 0 1 1 1 0 0 0 0 1 1 1 1 1 1 0 0 1 1 0 0 0 1 0 1 0 1 1 0 1 1 0 0 1 1 0 0 0 1 0 0 0 1 0 1 0 0 1 0 0 1 0 0 0 1 0 1 0 0 1 0 1 1 1 1 0 0 0

1 0 0 1 0 1 0 0 1 0 0 1 0 0 0 0 1 0 1 0 1 1 1 0 0 0 1 0 1 1 1 0 0 0 1 1 1 1 1 1 0 1 0 0 0 0 0 1 0 0 1 0 1 0 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 1 1 1 1 0 0 0 1 0 0 0 0 0 1 0 1 1 0 1 1 1 1 0 1 1 0 1 1 1 1 0

1

Selected area

Value of each element Parent

patterns

Child patterns

0 0 0 1 0 1 0 0 1 0 0 1 0 0 0 0 1 0 1 0 1 1 1 0 0 1 1 0 0 0 1 1 0 0 1 1 1 1 0 0 0 1 0 0 0 1 0 1 0 1 1 0 1 0 0 0 1 0 1 1 0 1 1 1 1 1 1 0 0 0 1 0 0 0 1 0 1 0 0 1 0 0 1 0 0 0 1 0 1 0 0 1 0 1 1 1 1 0 0 0 0 0 0 1 0 1 0 0 1 0 0 1 0 0 0 0 1 0 1 0 1 1 1 0 0 0 1 0 0 0 1 1 0 0 1 1 1 1 0 0 0 1 0 0 0 0 0 1 0 1 1 0 1 0 1 1 1 0 1 1 0 1 1 1 1 1 1 0 0 0 1 0 0 0 1 0 1 0 0 1 0 0 1 0 0 0 1 0 1 0 0 1 0 1 1 1 1 0 0 0

Selected area Parent pattern

Child pattern (a) Surface crossover principle (b) Surface mutation principle

Figure 1

One problem encountered in this set-up is the algorithm's difficulty to change the nature of the solution. We have remarked that the optimization is more efficient if several preliminary optimizations have been used to define the initial population.

ISEM 2003 (11th Internat. Symposium on Applied Electromagnetics and Mechanics) 12-14 may 03

(3)

3 Sample results

To illustrate, we present a simple example corresponding to an elementary linear actuator to variable reluctance. Iron and air compose the mobile part. The fixed part is made of iron and copper with a fixed current density. The objective function is to maximize the flux ratio between the conjunction and opposition positions.

Flux return Mobile part

Displacement Airgap Coils

Elementary pattern Mobile part

Displacement

Elementary pattern

(a) Conjunction position (b) Opposition position

Figure 2: Example of linear actuator

As pointed out in Section 2, several preliminary optimizations have been performed in order to define the initial population of the final optimization. Preliminary optimization results along with the final result are presented in the following figure:

First optimization Second optimization Third optimization Fourth optimization (a) Results of the preliminary optimization, in the opposition position

(b) Results of the final optimization

Opposition position Conjunction position Figure 3: Results of the optimisation

This final geometry enhances the benefit of splitting the copper coil to increase flux variation.

4 Conclusion

This paper has presented an improvement to the genetic algorithm used for OMD; this improvement is based on respecting the magnetic pattern geometry. The final paper will set forth a comparison between several OMD optimization algorithms. An application example, which has led to an original result, is also discussed. The final paper will provide more examples of optimal electromagnetic actuators.

5 References

[1] David A. Lowther, invited paper at Compumag Berlin (1995), IEEE T-Mag 32 n°3, pp. 1188-1193.

[2] N. Dyck and al., "Automated Design of Magnetic Devices by Optimization Material Distribution" IEEE on Magnetics, Vol. 32, n° 3, pp. 1188-1193, May 1996.

[3] S. Wang, "Topology Optimization of Nonlinear Magnetostatics" IEEE Transactions on Magnetics, Vol.

38, n° 2, March 2002.

[4] S. Dufour, G. Vinsard and B. Laporte, "Generating Rotor Geometries by Using a Genetic Method", IEEE Transactions on Magnetics, Vol. 36, n° 4, pp. 1039-1042, July 2000.

ISEM 2003 (11th Internat. Symposium on Applied Electromagnetics and Mechanics) 12-14 may 03

Références

Documents relatifs

d'approche en 1609, Galilée s'en servit à Florence pour observer toutes les planètes, et ce fut une source de découvertes toutes nouvelles il vit qu'il y avait des montagnes dans

Shakespeare’s Romeo and Juliet taught audiences to sympathize with tragic love stories about star-crossed young lovers cut short by premature death, a model

Biham , \Two practical and provably secure block ciphers: BEAR and LION." Proceedings of the 3rd Fast Software Encryption Workshop, Lecture Notes in Computer Science Vol...

Assuming h is ideal the security of this hash function can be directly related to the problem underlying the security of Ajtai's one-way function [Aj, GGH] so that it is

Afterward, in two dimensions, we prove that the second- and the third-order accurate fully-discrete ALE-DG methods satisfy the maximum principle when the bound-preserving

We will establish a local Li-Yau’s estimate for weak solutions of the heat equation and prove a sharp Yau’s gradient gradient for harmonic functions on metric measure spaces, under

In this paper, we will see that a surjective linear local automorphism θ of a von Neumann algebra N is a Jordan isomorphism. In case N is properly infinite, θ is an automorphism. On

In our very recent paper [36], we developed a time-domain finite element method to simulate a cylindrical cloak [52], and carried out some mathematical analysis for this model..