• Aucun résultat trouvé

Simulated Annealing as an Optimization Algorithm in the Automatic Modular Design of Robot Swarms

N/A
N/A
Protected

Academic year: 2022

Partager "Simulated Annealing as an Optimization Algorithm in the Automatic Modular Design of Robot Swarms"

Copied!
2
0
0

Texte intégral

Références

Documents relatifs

approaches, the optimized domain is first discretized into a set of design variables (for instance, the vertices of a mesh); the PDE system (1) becomes finite-dimensional (it is

We assess Coconut in the design of collective behaviors for missions that require robot swarms to explore in different manners: aggregation—searching for a specific location

The algorithm is applicable only for cases when the exchange interaction constant is the same for all pairs of interacting spins. Any lattice architecture and

In this work, we studied thephenomenon of the buckling which was devoted underinvestigation of the optimization of a composite materiallaminated by the use of a data-processing

To examine the effect of the orientation of the folds of our laminate (Carbon-Epoxy) on the factor of buckling criticizes λcr, we took the data of the sequences of

In this work, we havepresented the principles of the genetic algorithm functioning , itsapplication to the laminated composites and to the originaltechnique of coding which

This histogram (Figu 6) represents the rupture factor by deformation and the critical buckling factor of the individual optimal after the generation of the final

In fact, the best solution found by the GA, here called H-GA, uses only 31% of the dimensions from the canonical version of the descriptor and still achieves a similar performance.