Chaos Synthesis by Evolutionary Algorithms

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F10%3A00340465" target="_blank" >RIV/67985556:_____/10:00340465 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/68407700:21230/10:00167224 RIV/61989100:27240/10:86075797

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Chaos Synthesis by Evolutionary Algorithms

Popis výsledku v původním jazyce

This chapter introduces the notion of chaos synthesis by means of evolutionary algorithms and develops a new method for chaotic systems synthesis. This method is similar to genetic programming and grammatical evolution and is applied alongside evolutionary algorithms: differential evolution, self organizingmigrating, genetic algorithm, simulated annealing and evolutionary strategies. The aim of this investigation is to synthesize new and ?simple chaotic systems based on some elements contained in a pre-chosen existing chaotic system and a properly defined cost function. The investigation consists of two case studies based on the aforementioned evolutionary algorithms in various versions. For all algorithms, 100 simulations of chaos synthesis were repeated and then averaged to guarantee the reliability and robustness of the proposed method. The most significant results are carefully selected, visualized and commented in this chapter.

Název v anglickém jazyce

Chaos Synthesis by Evolutionary Algorithms

Popis výsledku anglicky

This chapter introduces the notion of chaos synthesis by means of evolutionary algorithms and develops a new method for chaotic systems synthesis. This method is similar to genetic programming and grammatical evolution and is applied alongside evolutionary algorithms: differential evolution, self organizingmigrating, genetic algorithm, simulated annealing and evolutionary strategies. The aim of this investigation is to synthesize new and ?simple chaotic systems based on some elements contained in a pre-chosen existing chaotic system and a properly defined cost function. The investigation consists of two case studies based on the aforementioned evolutionary algorithms in various versions. For all algorithms, 100 simulations of chaos synthesis were repeated and then averaged to guarantee the reliability and robustness of the proposed method. The most significant results are carefully selected, visualized and commented in this chapter.

Druh

C - Kapitola v odborné knize

CEP obor

BC - Teorie a systémy řízení

OECD FORD obor

—

Projekt

<a href="/cs/project/GA102%2F08%2F0186" target="_blank" >GA102/08/0186: Algoritmy pro analýzu a návrh řízení složitých systémů</a><br>

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2010

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název knihy nebo sborníku

Evolutionary Algorithms and Chaotic Systems

ISBN

978-3-642-10706-1

Počet stran výsledku

38

Strana od-do

—

Počet stran knihy

521

Název nakladatele

Springer-Verlag

Místo vydání

Berlin

Kód UT WoS kapitoly

—