Stabilization of Higher Periodic Orbits of the Duffing Map using Meta-evolutionary Approaches: A Preliminary Study

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F22%3APU145484" target="_blank" >RIV/00216305:26210/22:PU145484 - isvavai.cz</a>

Result on the web

<a href="https://ieeexplore.ieee.org/document/9870372" target="_blank" >https://ieeexplore.ieee.org/document/9870372</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/CEC55065.2022.9870372" target="_blank" >10.1109/CEC55065.2022.9870372</a>

Result language

angličtina

Original language name

Stabilization of Higher Periodic Orbits of the Duffing Map using Meta-evolutionary Approaches: A Preliminary Study

Original language description

This paper deals with an advanced adjustment of stabilization sequences for complex chaotic systems by means of meta-evolutionary approaches in the form of a preliminary study. In this study, a two-dimensional discrete-time dynamic system denoted as Duffing map, also called Holmes map, was used. In general, the Duffing oscillator model represents a real system in the field of nonlinear dynamics. For example, an excited model of a string choosing between two magnets. There are many articles on the stabilization of various chaotic maps, but attempts to stabilize the Duffing map, moreover, for higher orbits, are rather the exception. In the case of period four, this is a novelty. This paper presents several approaches to obtaining stabilizing perturbation sequences. The problem of stabilizing the Duffing map turns out to be difficult and is a good challenge for metaheuristic algorithms, and also as benchmark function. The first approach is the optimal parameterization of the ETDAS model using multi-restart Nelder-Mead (NM) algorithm na Genetic Algorithm (GA). The second approach is to use the symbolic regression procedure. A perturbation model is obtained using Genetic Programming (GP). The third approach is two-level optimization, where the best GP model is subsequently optimized using NM and GA algorithms. A novelty of the approach is also the effective use of the objective function, precisely in relation to the process of optimization of higher periodic paths.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2022

Confidentiality

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

Article name in the collection

2022 IEEE Congress on Evolutionary Computation (CEC)

ISBN

978-1-7281-8393-0

ISSN

—

e-ISSN

—

Number of pages

8

Pages from-to

1-8

Publisher name

IEEE

Place of publication

Padova, Italy

Event location

Padova, Italy

Event date

Jul 18, 2022

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

000859282000155