A NEW ALGORITHM FOR TOPOLOGY OPTIMIZATION USING A LEVEL SET METHOD

Description

Niveau: Supérieur, Doctorat, Bac+8
A NEW ALGORITHM FOR TOPOLOGY OPTIMIZATION USING A LEVEL-SET METHOD SAMUEL AMSTUTZ AND HEIKO ANDRA Abstract. The level-set method has been recently introduced in the field of shape optimiza- tion, enabling a smooth representation of the boundaries on a fixed mesh and therefore leading to fast numerical algorithms. However, most of these algorithms use a Hamilton-Jacobi equa- tion to connect the evolution of the level-set function with the deformation of the contours, and consequently they can hardly create new holes in the domain (at least in 2D). In this work, we propose an evolution equation for the level-set function based on a generalization of the con- cept of topological gradient. This results in a new algorithm allowing for all kinds of topology changes. 1. Introduction Many methods have been worked out for the automatic optimization of elastic structures. The oldest and most popular one, the so-called classical shape optimization method [21, 28], is based on the computation of the sensitivity of the criterion of interest with respect to a smooth variation of the boundary. Its main drawback is that it does not allow any topology changes. To overcome this limitation, relaxed formulations using e.g. the homogenization theory have been introduced [1, 2, 6, 11, 12, 18]. However, these methods are mainly restricted to linear elasticity and particular objective functions.

• ?i ?


• has been


• design variable


• optimization using


• domain


• shape optimization


• local minima


• gradient

Sujets

• Has Been
• Domain
• Shape optimization
• Maxima and minima
• Gradient

Informations

• Publié par: profil-zyak-2012
• Nombre de lectures: 23
• Langue: English
• Poids de l'ouvrage: 4 Mo

Extrait

ANEWALGORITHMFORTOPOLOGYOPTIMIZATIONUSINGA LEVEL-SETMETHOD SAMUELAMSTUTZANDHEIKOANDRA ¨ Abstract.Thelevel-setmethodhasbeenrecentlyintroducedinthefieldofshapeoptimiza- tion,enablingasmoothrepresentationoftheboundariesonafixedmeshandthereforeleading tofastnumericalalgorithms.However,mostofthesealgorithmsuseaHamilton-Jacobiequa- tiontoconnecttheevolutionofthelevel-setfunctionwiththedeformationofthecontours,and consequentlytheycanhardlycreatenewholesinthedomain(atleastin2D).Inthiswork,we proposeanevolutionequationforthelevel-setfunctionbasedonageneralizationofthecon- ceptoftopologicalgradient.Thisresultsinanewalgorithmallowingforallkindsoftopology changes. 1.Introduction Manymethodshavebeenworkedoutfortheautomaticoptimizationofelasticstructures. Theoldestandmostpopularone,theso-calledclassicalshapeoptimizationmethod[21,28],is basedonthecomputationofthesensitivityofthecriterionofinterestwithrespecttoasmooth variationoftheboundary.Itsmaindrawbackisthatitdoesnotallowanytopologychanges.To overcomethislimitation,relaxedformulationsusing e.g. thehomogenizationtheoryhavebeen introduced[1,2,6,11,12,18].However,thesemethodsaremainlyrestrictedtolinearelasticity andparticularobjectivefunctions.Despitetheirhighcomputationalcost,stochasticalgorithms (likegeneticalgorithms,see e.g. [19])canbeusedtodealwithmoregeneralsituations,orwhen practicalreasonsmakedifficultasensitivitycomputation(forinstancetheadjointstatemaynot beeasilycomputable). Thelevel-setmethod,whichhasseveraladvantages,wasinstigatedbyOsherandSethian[23] fornumericallytrackingfrontsandfreeboundaries,andrecentlyintroducedinthefieldofshape optimization[4,5,13,22,25,30].First,itsmainfeatureistoenableanaccuratedescription oftheboundariesonafixedmesh.Thereforeitleadstofastnumericalalgorithms.Second,its rangeofapplicationisverywide,sincethefrontvelocitycanbederivedfromtheclassicalshape sensitivity.Finally,itcanhandlesometopologychanges.Indeed,withintheusualframeworkof thecontrolofthelevel-setfunctionbyaHamilton-Jacobiequation,themergingandcancellation ofholesprovetooccurinanaturalway.Conversely,thenucleationofnewholesseemstobe ratherunlikelyinpracticalsituations.In3D,holescanstillappearbypinchingtwoboundaries, butthisprocessisimpossiblein2D.Itfollowsthattheobtaineddesignisstronglydependent ontheinitialguessinthiscase. Besides,thenotionoftopologicalgradient[16,20,24,27]hasbeendevisedtomeasurethe sensitivityofacriterionwithrespecttothesizeofasmallholecreatedaroundagivenpointof thedomain.Thisconceptgaverisetoanotherclassofoptimaldesignalgorithms.Instructural optimization,oneusuallyusesafixedpointmethodofthetype Ω k +1 :={x∈Ω k ,g k (x)>c k },k=0,1,2,...,(1) whereg k denotesthetopologicalgradientcomputedinthedomainΩ k andc k <0isathreshold playingtheroleofastepsize(see[16,15]).Themaindrawbackofthisprocedureisitsinability toaddmatterinsomeplaceswhereithasbeenremoved“bymistake”atpreviousiterations. Inthispaper,weproposeamodificationof(1)basedonageneralizationoftheconcept oftopologicalgradientandtherepresentationofthedomainbyalevel-setfunctionpossibly 1