Evolutionary synchronization of chaotic systems

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F10%3A10082130" target="_blank" >RIV/00216208:11320/10:10082130 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/61989100:27240/10:86075799

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Evolutionary synchronization of chaotic systems

Popis výsledku v původním jazyce

This chapter introduces a simple investigation on deterministic chaos synchronization by means of selected evolutionary techniques. Five evolutionary algorithms has been used for chaos synchronization here: differential evolution, selforganizing migrating algorithm, genetic algorithm, simulated annealing and evolutionary strategies in a total of 15 versions. Experiments in this chapter has been done with two different coupled systems (master - slave) - Rossler-Lorenz and Lorenz-Lorenz. The main aim of this chapter was to show that evolutionary algorithms, under certain conditions, are capable of synchronization of, at least, simple chaotic systems, when the cost function is properly defined as well as the parameters of selected evolutionary algorithm.This chapter consists of two different case studies. For all algorithms each simulation was 100 times repeated to show and check the robustness of proposed methods and experiment configurations.

Název v anglickém jazyce

Evolutionary synchronization of chaotic systems

Popis výsledku anglicky

This chapter introduces a simple investigation on deterministic chaos synchronization by means of selected evolutionary techniques. Five evolutionary algorithms has been used for chaos synchronization here: differential evolution, selforganizing migrating algorithm, genetic algorithm, simulated annealing and evolutionary strategies in a total of 15 versions. Experiments in this chapter has been done with two different coupled systems (master - slave) - Rossler-Lorenz and Lorenz-Lorenz. The main aim of this chapter was to show that evolutionary algorithms, under certain conditions, are capable of synchronization of, at least, simple chaotic systems, when the cost function is properly defined as well as the parameters of selected evolutionary algorithm.This chapter consists of two different case studies. For all algorithms each simulation was 100 times repeated to show and check the robustness of proposed methods and experiment configurations.

Druh

C - Kapitola v odborné knize

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

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 algoritms and chaotic systems

ISBN

978-3-642-10706-1

Počet stran výsledku

25

Strana od-do

—

Počet stran knihy

521

Název nakladatele

Springer

Místo vydání

Berlin / Heideberg

Kód UT WoS kapitoly

—