Semi-Stable Periodic Orbits of the Deterministic Chaotic Systems Designed by means of Genetic Programming

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F24%3APU155878" target="_blank" >RIV/00216305:26220/24:PU155878 - isvavai.cz</a>

Result on the web

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

DOI - Digital Object Identifier

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

Result language

angličtina

Original language name

Semi-Stable Periodic Orbits of the Deterministic Chaotic Systems Designed by means of Genetic Programming

Original language description

The aim of this paper is to show the possibility of generating general semi-stable periodic orbits using genetic programming (GP). This concept is a GP design of a perturbation sequence that forces a defined dynamical system to behave periodically. Recall that periodic orbits in deterministic chaotic systems are trajectories along which the system moves at regular intervals. Despite the chaotic nature of these systems, periodic orbits represent the repetition of certain states of the system over time. In chaotic systems, these orbits are usually surrounded by complex, irregular trajectories, but are themselves defined by regularity and predictability. We should add that periodic orbits are important to chaos theory because they provide a basis for understanding the internal structure of chaotic systems. Although chaos is defined by unpredictability based on initial conditions and the complexity, these periodic orbits represent islands of predictability that can be analyzed and modeled. GP and its symbolic regression capability is an ideal tool for finding both stable periodic orbits defined by stable points and general periodic orbits that rebuild attractive periodic states for the system. The objective function is also crucial for finding periodic orbits using GP. This function has been designed to achieve stable regions as well as the possibility of choosing the degree of the orbital. The test problem will consist of four systems of deterministic chaos, the so-called chaotic maps - the logistic map, the Henon map, the Lozi map and the Burgers map.

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

<a href="/en/project/GA24-12474S" target="_blank" >GA24-12474S: Benchmarking derivative-free global optimization methods</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2024

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

2024 IEEE Congress on Evolutionary Computation (CEC)

ISBN

979-8-3503-0836-5

ISSN

—

e-ISSN

—

Number of pages

7

Pages from-to

„“-„“

Publisher name

IEEE

Place of publication

neuveden

Event location

Yokohama

Event date

Jun 30, 2024

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—