# Chaos Enhanced Differential Evolution in the Task of Evolutionary Control of Selected Set of Discrete Chaotic Systems

Authors: Roman Senkerik; Ivan Zelinka; Michal Pluhacek; Donald Davendra; Zuzana Oplatková Kominkova
Journal: The Scientific World Journal
 (2014)

---

## Abstract

Evolutionary technique differential evolution (DE) is used for the evolutionary tuning of controller parameters for the stabilization of set of different chaotic systems. The novelty of the approach is that the selected controlled discrete dissipative chaotic system is used also as the chaotic pseudorandom number generator to drive the mutation and crossover process in the DE. The idea was to utilize the hidden chaotic dynamics in pseudorandom sequences given by chaotic map to help differential evolution algorithm search for the best controller settings for the very same chaotic system. The optimizations were performed for three different chaotic systems, two types of case studies and developed cost functions.


---

## Body

## 1. Introduction

In many engineering applications, one of the most innate tasks is the controlling of highly nonlinear dynamical systems in order to either eliminate or synchronize the chaos. The first pioneering approach to control chaotic dynamics by means of a simple analytical linearization method was introduced in 1990s by Ott et al. (i.e., OGY method) [1]. Subsequently, the rapid development of methods for stabilizing of nonlinear chaotic dynamics has arisen and many advanced techniques have been applied for chaos control and chaos synchronization including methods from the artificial intelligence field.During recent years, usage of new intelligent systems in engineering, technology, modeling, computing, and simulations has attracted the attention of researchers worldwide. The most current methods are mostly based on soft computing, which is a discipline tightly bound to computers, representing a set of methods of special algorithms, belonging to the artificial intelligence paradigm. The most popular of these methods are neural networks, evolutionary algorithms (EAs), fuzzy logic, and tools for symbolic regression like genetic programming. Currently, EAs are known as a powerful set of tools for almost any difficult and complex optimization problem.The interest about the interconnection between evolutionary techniques and control of chaotic systems is rapidly spreading. The initial research was conducted in [2], whereas [3, 4] was more concerned with the tuning of parameters inside the chaos control technique based on the Pyragas method: extended delay feedback control (ETDAS) [5]. When compared to the aforementioned research, later works [6, 7] show a possibility as to how to generate the entire control law (not only how to optimize several parameters) for the purpose of stabilization of a chaotic system. Such approach also may overcome the possible sensitivity to initial conditions which may lead to stability issues. The synthesis of control is inspired by the Pyragas’ delayed feedback control technique [8, 9]. This method is very advantageous for the evolutionary computation, due to its amount of easy accessible control parameters, which can be easily tuned by means of EAs.Other approaches utilizing the EAs for stabilizing chaotic dynamics have mostly applied the particle swarm optimization (PSO) algorithm [10] and multi-interval gradient method [11] or minimum entropy control technique [12]. EAs have been also frequently used in the task of synchronization of chaos [13–15]. In [16], an EA for optimizing local control of chaos based on a Lyapunov approach is presented.Evolutionary techniques were also used for the synthesis of new complex discrete type structures with chaotic behavior [17] as well as the synthesis (identification) of a mathematical model of chaotic system based on the measured data [18].Another example of interconnection between deterministic chaos and EAs represents the research focused on the embedding of chaotic dynamics into the EAs. Recent research in chaos driven heuristics has been fueled with the predisposition that, unlike stochastic approaches, a chaotic approach is able to bypass local optima stagnation. This one clause is of deep importance to EAs. A chaotic approach generally uses the chaotic map in the place of a pseudorandom number generator [19]. This causes the heuristic to map unique regions, since the chaotic map iterates to new regions. The task is then to select a very good chaotic map as the pseudorandom number generator.The initial concept of embedding chaotic dynamics into EAs is given in [20]. Later, the initial study [21] was focused on the simple embedding of chaotic systems in the form of chaos pseudorandom number generator (CPRNG) for differential evolution (DE) [22] and self-organizing migrating algorithm (SOMA) [23] in the task of optimal PID tuning. Also, the PSO algorithm with elements of chaos was introduced as the CPSO [24]. This field of research was later extended with the successful experiments with chaos driven DE [25] in real domain as well as in combinatorial problems domain [26, 27].At the same time, the chaos embedded PSO with inertia weigh strategy was closely investigated [28], followed by the introduction of a PSO strategy driven alternately by two chaotic systems [29] and novel chaotic multiple choice PSO (chaos MC-PSO) strategy [30]. Recently, the chaotic firefly algorithm was also introduced [31].Finally, the last example represents the research focusing on the EAs and the edge of chaos. An unconventional approach of the edge of chaos and its application to discrete systems and evolutionary algorithms in terms of stagnation avoidance is presented in [32].The organization of this paper is as follows: firstly, used evolutionary technique, which is DE, is described and is followed by the description of the ChaosDE concept. Thereafter, the problem design and appropriate corresponding cost functions are investigated and proposed. Results and conclusion follow afterwards.


## 2. Motivation

This paper extends the research of evolutionary chaos control optimization by means of ChaosDE algorithm [33–35]. Recent studies have shown that differential evolution [22] is one of the most potent heuristics and it has been used for a number of optimization tasks; [36–38] have explored DE for combinatorial problems; [39, 40] have hybridized DE whereas [41–43] have developed self-adaptive DE variants.In this paper, the DE/rand/1/bin strategy driven by different chaotic maps (systems) was utilized to solve the issue of evolutionary optimization of chaos control for the very same chaotic system used as a CPRNG in the particular case study. Thus, the idea was to utilize the hidden chaotic dynamics in pseudorandom sequences given by chaotic map to help differential evolution algorithm search for the best controller settings for the very same chaotic system. Since the very positive contribution of the chaotic dynamics to the performance of DE in the task of evolutionary chaos control optimization was proven in comparison with original canonical DE within the initial study [44], this paper is not primarily focused on the performance comparisons with different heuristic. But this research extends the initial work with the aforementioned idea and with the several case studies combining different chaotic systems and different utilized cost functions.


## 3. Used Heuristic: Differential Evolution (DE)

DE is a simple and powerful population-based optimization method that works either on real-number-coded individuals or with small modifications on discrete type individuals [22, 45, 46]. DE is quite robust, fast, and effective, with global optimization ability. This global optimization ability has been proven in many interdisciplinary researches. It works well even with noisy and time-dependent objective functions. The canonical basic principle is as follows.For each individualx
→
i
,
G in the current generation G, DE generates a new trial individual x
→
i
,
G
′ by adding the weighted difference between two randomly selected individuals x
→
r
1
,
G and x
→
r
2
,
G to a randomly selected third individual x
→
r
3
,
G. The resulting individual x
→
i
,
G
′ is crossed over with the original individual x
→
i
,
G. The fitness of the resulting individual, referred to as a perturbed vector u
→
i
,
G
+
1, is then compared with the fitness of x
→
i
,
G. If the fitness of u
→
i
,
G
+
1 is greater than the fitness of x
→
i
,
G, then x
→
i
,
G is replaced with u
→
i
,
G
+
1; otherwise, x
→
i
,
G remains in the population as x
→
i
,
G
+
1.Please refer to (1) for notation of crossover and to [22] for the detailed description of used DERand1Bin strategy and all other DE strategies:
(1)
u
i
,
G
+
1
=
x
r
1
,
G
+
F
·
(
x
r
2
,
G
-
x
r
3
,
G
)
.


## 4. Concept of ChaosDE

This section contains the description of discrete dissipative chaotic maps, which can be used as the chaotic pseudorandom generators for DE as well as the main principle of the ChaosDE concept. In this research, direct output iterations of the chaotic maps were used for the generation of real numbers in the process of crossover based on the user definedCR value and for the generation of the integer values used for selection of individuals.


### 4.1. Chaotic Pseudorandom Number Generator

The general idea of ChaosDE and CPRNG is to replace the default PRNG with the discrete chaotic map. As the discrete chaotic map is a set of equations with a static start position, we created a random start position of the map, in order to have different start position for different experiments (runs of EAs). This random position is initialized with the default PRNG, as a one-off randomizer. Once the start position of the chaotic map has been obtained, the map generates the next sequence using its current position.The first possible way is to generate and store a long data sequence (approximately 50–500 thousands numbers) during the evolutionary process initialization and keep the pointer to the actual used value in the memory. In case of the using up of the whole sequence, the new one will be generated with the last known value as the new initial one.The second approach is that the chaotic map is not reinitialized during the experiment and any long data series is not stored; thus it is imperative to keep the current state of the map in memory to obtain the new output values.As two different types of numbers are required in ChaosDE, real and integers, the use of modulo operators is used to obtain values between the specified ranges, as given in the following equations (2):
(2)
rndreal
=
mod
⁡
(
abs
(
rndChaos
)
,
1.0
)
rndint
=
mod
⁡
(
abs
(
rndChaos
)
,
1.0
)
×
Range
+
1
,
where abs refers to the absolute portion of the chaotic map generated number rndChaos, mod is the modulo operator, and Range specifies the value (inclusive) till where the number is to be scaled.


### 4.2. Selected Chaotic Systems

This subsection contains the mathematical and graphical description of the three selected discrete dissipative systems, which served both as for CPRNGs and also as the examples of systems to be evolutionary controlled.


#### 4.2.1. Burgers Map

The Burgers mapping is a discretization of a pair of coupled differential equations which were used by Burgers to illustrate the relevance of the concept of bifurcation to the study of hydrodynamics flows. The map equations are given in (3) with control parameters a
=
0.75 and b
=
1.75 as suggested in [47]:
(3)
X
n
+
1
=
a
X
n
-
Y
n
2
,
Y
n
+
1
=
b
Y
n
+
X
n
Y
n
.


#### 4.2.2. Delayed Logistic

The delayed logistic is a simple two-dimensional discrete system similar to the one-dimensional logistic equation. The map equations are given in (4). The parameter used in this work is A
=
2.27 as also suggested in [47]:
(4)
X
n
+
1
=
A
X
n
(
1
-
Y
n
)
,
Y
n
+
1
=
X
n
.


#### 4.2.3. Lozi Map

The Lozi map is a simple discrete two-dimensional chaotic map. The map equations are given in (5). The parameters used in this work are as follows: a
=
1.7 and b
=
0.5 as suggested in [47]. For these values, the system exhibits typical chaotic behavior and, with this parameter setting, it is used in most research papers and other literature sources [48]:
(5)
X
n
+
1
=
1
-
a
|
X
n
|
+
b
Y
n
,
Y
n
+
1
=
X
n
.


### 4.3. Graphical Examples

Three chaotic maps were selected for the CPRNG concept. Thex, y plots of the selected maps are depicted in Figure 1 (Burgers map), Figure 4 (delayed logistic map), and Figure 7 (Lozi map). The chaotic behavior of the chaotic maps, represented by the examples of direct output iterations, is depicted in Figures 2, 5, and 8. Finally, the illustrative histograms of the distribution of real numbers transferred into the range 〈
0
-
1
〉 generated by means of chaotic maps are in Figures 3, 6, and 9.Figure 1
x, y plot of the Burgers map.Iterations of the Burgers map (variablex) (a), iterations of the Burgers map (variable x), point-plot (b).
(a)
(b)Figure 3
Histogram of the distribution of real numbers transferred into the range〈
0
-
1
〉 generated by means of the chaotic Burgers map, 5000 samples.Figure 4
x, y plot of the delayed logistic map.Iterations of the delayed logistic (variablex) (a), iterations of the delayed logistic (variable x), point-plot (b).
(a)
(b)Figure 6
Histogram of the distribution of real numbers transferred into the range〈
0
-
1
〉 generated by means of the chaotic delayed logistic map, 5000 samples.Figure 7
x, y plot of the Lozi map.Iterations of the Lozi map (variablex) (a), iterations of the Lozi map (variable x), point-plot (b).
(a)
(b)Figure 9
Histogram of the distribution of real numbers transferred into the range〈
0
-
1
〉 generated by means of the chaotic Lozi map, 5000 samples.


## 4.1. Chaotic Pseudorandom Number Generator

The general idea of ChaosDE and CPRNG is to replace the default PRNG with the discrete chaotic map. As the discrete chaotic map is a set of equations with a static start position, we created a random start position of the map, in order to have different start position for different experiments (runs of EAs). This random position is initialized with the default PRNG, as a one-off randomizer. Once the start position of the chaotic map has been obtained, the map generates the next sequence using its current position.The first possible way is to generate and store a long data sequence (approximately 50–500 thousands numbers) during the evolutionary process initialization and keep the pointer to the actual used value in the memory. In case of the using up of the whole sequence, the new one will be generated with the last known value as the new initial one.The second approach is that the chaotic map is not reinitialized during the experiment and any long data series is not stored; thus it is imperative to keep the current state of the map in memory to obtain the new output values.As two different types of numbers are required in ChaosDE, real and integers, the use of modulo operators is used to obtain values between the specified ranges, as given in the following equations (2):
(2)
rndreal
=
mod
⁡
(
abs
(
rndChaos
)
,
1.0
)
rndint
=
mod
⁡
(
abs
(
rndChaos
)
,
1.0
)
×
Range
+
1
,
where abs refers to the absolute portion of the chaotic map generated number rndChaos, mod is the modulo operator, and Range specifies the value (inclusive) till where the number is to be scaled.


## 4.2. Selected Chaotic Systems

This subsection contains the mathematical and graphical description of the three selected discrete dissipative systems, which served both as for CPRNGs and also as the examples of systems to be evolutionary controlled.


### 4.2.1. Burgers Map

The Burgers mapping is a discretization of a pair of coupled differential equations which were used by Burgers to illustrate the relevance of the concept of bifurcation to the study of hydrodynamics flows. The map equations are given in (3) with control parameters a
=
0.75 and b
=
1.75 as suggested in [47]:
(3)
X
n
+
1
=
a
X
n
-
Y
n
2
,
Y
n
+
1
=
b
Y
n
+
X
n
Y
n
.


### 4.2.2. Delayed Logistic

The delayed logistic is a simple two-dimensional discrete system similar to the one-dimensional logistic equation. The map equations are given in (4). The parameter used in this work is A
=
2.27 as also suggested in [47]:
(4)
X
n
+
1
=
A
X
n
(
1
-
Y
n
)
,
Y
n
+
1
=
X
n
.


### 4.2.3. Lozi Map

The Lozi map is a simple discrete two-dimensional chaotic map. The map equations are given in (5). The parameters used in this work are as follows: a
=
1.7 and b
=
0.5 as suggested in [47]. For these values, the system exhibits typical chaotic behavior and, with this parameter setting, it is used in most research papers and other literature sources [48]:
(5)
X
n
+
1
=
1
-
a
|
X
n
|
+
b
Y
n
,
Y
n
+
1
=
X
n
.


## 4.2.1. Burgers Map

The Burgers mapping is a discretization of a pair of coupled differential equations which were used by Burgers to illustrate the relevance of the concept of bifurcation to the study of hydrodynamics flows. The map equations are given in (3) with control parameters a
=
0.75 and b
=
1.75 as suggested in [47]:
(3)
X
n
+
1
=
a
X
n
-
Y
n
2
,
Y
n
+
1
=
b
Y
n
+
X
n
Y
n
.


## 4.2.2. Delayed Logistic

The delayed logistic is a simple two-dimensional discrete system similar to the one-dimensional logistic equation. The map equations are given in (4). The parameter used in this work is A
=
2.27 as also suggested in [47]:
(4)
X
n
+
1
=
A
X
n
(
1
-
Y
n
)
,
Y
n
+
1
=
X
n
.


## 4.2.3. Lozi Map

The Lozi map is a simple discrete two-dimensional chaotic map. The map equations are given in (5). The parameters used in this work are as follows: a
=
1.7 and b
=
0.5 as suggested in [47]. For these values, the system exhibits typical chaotic behavior and, with this parameter setting, it is used in most research papers and other literature sources [48]:
(5)
X
n
+
1
=
1
-
a
|
X
n
|
+
b
Y
n
,
Y
n
+
1
=
X
n
.


## 4.3. Graphical Examples

Three chaotic maps were selected for the CPRNG concept. Thex, y plots of the selected maps are depicted in Figure 1 (Burgers map), Figure 4 (delayed logistic map), and Figure 7 (Lozi map). The chaotic behavior of the chaotic maps, represented by the examples of direct output iterations, is depicted in Figures 2, 5, and 8. Finally, the illustrative histograms of the distribution of real numbers transferred into the range 〈
0
-
1
〉 generated by means of chaotic maps are in Figures 3, 6, and 9.Figure 1
x, y plot of the Burgers map.Iterations of the Burgers map (variablex) (a), iterations of the Burgers map (variable x), point-plot (b).
(a)
(b)Figure 3
Histogram of the distribution of real numbers transferred into the range〈
0
-
1
〉 generated by means of the chaotic Burgers map, 5000 samples.Figure 4
x, y plot of the delayed logistic map.Iterations of the delayed logistic (variablex) (a), iterations of the delayed logistic (variable x), point-plot (b).
(a)
(b)Figure 6
Histogram of the distribution of real numbers transferred into the range〈
0
-
1
〉 generated by means of the chaotic delayed logistic map, 5000 samples.Figure 7
x, y plot of the Lozi map.Iterations of the Lozi map (variablex) (a), iterations of the Lozi map (variable x), point-plot (b).
(a)
(b)Figure 9
Histogram of the distribution of real numbers transferred into the range〈
0
-
1
〉 generated by means of the chaotic Lozi map, 5000 samples.


## 5. Design of Cost Functions for Chaotic System Stabilization

The proposal of the basic cost function (CFSimple) is in general based on the simplest CF, which could be used problem-free only for the stabilization of p-1 orbit. The idea was to minimize the area created by the difference between the required state and the real system output on the whole simulation interval, τ
i (6). This CF design is very convenient for the evolutionary searching process due to the relatively favorable CF surface. Nevertheless, this simple approach has one big disadvantage, which is the including of initial chaotic transient behavior of not stabilized system into the cost function value. As a result of this, the very tiny change of control method setting for extremely sensitive chaotic system (given by the very small change of CF value) can be suppressed by the aforementioned inclusion of initial chaotic transient behavior. Consider
(6)
CF
Simple
=
∑
t
=
0
τ
i
|
TS
t
-
AS
t
|
,
where TS is target state and AS is actual state.Different type of universal cost function without any selection rules is purely based on searching for the desired stabilized periodic orbit and thereafter calculation of the difference between desired and found actual periodic orbit on the short time interval,τ
s (20 iterations), from the point where the first minimal value of difference between desired and actual system output is found (i.e., floating window for minimization; see Figure 10).Figure 10
“Floating window” for minimization.Such a design of universal CF should secure the successful stabilization of either p-1 orbit (stable state) or any higher periodic orbit anywise phase shifted. Furthermore, due to CF values converging towards zero, this CF also allows the use of decision rules, avoiding very time demanding simulations. This rule stops EA immediately, when the first individual with good parameter structure is reached; thus the value of CF is lower than the acceptable (CFacc) one. Based on the numerous experiments, typically CF
acc
=
0.001 at time interval τ
s
=
20 iterations; thus the difference between desired and actual output has the value of 0.0005 per iteration, that is, successful stabilization for the used control technique. The C
F
UNI has the following form:
(7)
C
F
UNI
=
p
e
n
1
+
∑
t
=
τ
1
τ
2
|
TS
t
-
AS
t
|
,
where τ
1 is the first min value of the difference between TS and AS and τ
2 is the end of optimization interval (
τ
1
+
τ
s
)
,
p
e
n
1
=
0 if τ
i
-
τ
2
≥
τ
s
;
p
e
n
1
=
10
*
(
τ
i
-
τ
2
) if τ
i
-
τ
2
<
τ
s (i.e., late stabilization).The issue of pure searching for periodic orbits causes very chaotic, erratic, and discrete type CF surfaces.


## 6. Experimental Design

This research encompasses six case studies. Six different sets of discrete chaotic systems as CPRNGs/to be controlled and two different cost functions were combined in the following form:(i)
case study 1: Burgers map as CPRNG/controlled system with CFSimple,
(ii)
case study 2: Burgers map as CPRNG/controlled system withC
F
UNI,
(iii)
case study 3: delayed logistic map as CPRNG/controlled system with CFSimple,
(iv)
case study 4: delayed logistic map as CPRNG/controlled system withC
F
UNI,
(v)
case study 5: Lozi map as CPRNG/controlled system with CFSimple,
(vi)
case study 6: Lozi map as CPRNG/controlled system withC
F
UNI.This work is focused on the utilization of the chaos driven DE for tuning of parameters for ETDAS control method to stabilize desired unstable periodic orbits (UPO). In the described research, desired UPO was p-1 (stable state). The original control method, ETDAS, in the discrete form suitable for discrete chaotic maps has the following form:(8)
F
n
=
K
[
(
1
-
R
)
S
n
-
m
-
x
n
]
,
S
n
=
x
n
+
R
S
n
-
m
,
where K and R are adjustable constants, F is the perturbation, S is given by a delay equation utilizing previous states of the system, and m is the period of m-periodic orbit to be stabilized. The perturbation F
n in (8) may have arbitrarily large value, which can cause the divergence of the system. Therefore, F
n should have a value between—F
max
⁡ and F
max
⁡. The ranges of all evolutionary estimated parameters are given in Table 1.Table 1
Estimated parameters.
Parameter
Min
Max
K
-
2
2
R
0
0.99
F
max
⁡
0
0.9Within the research, a total number of 50 simulations with ChaosDE were carried out for each case study. The parameter settings for ChaosDE were obtained analytically based on numerous experiments and simulations (see Table2). Experiments were performed in an environment ofWolfram Mathematica; PRNG operations therefore used the built-inMathematica software pseudorandom number generator. All experiments used different initialization; that is, different initial population was generated in each run of chaos driven DE.Table 2
DE settings.
Parameter
Value
Population size
25
F
0.8
Cr
0.8
Generations
250
Max cost function evaluations (CFE)
6250


## 7. Results

All simulations were successful and have given new optimal settings for ETDAS control method securing the fast stabilization of the chaotic system at required behaviour (p-1 orbit). Tables4, 5, 6, 7, 8, and 9 contain the simple statistical overview of optimization/simulation results as well as the best founded individual solutions of parameters setup for ETDAS control method, corresponding final CF value, also, the Istab. Value representing the number of iterations required for stabilization on desired UPO, and further the average error between desired output value and real system output from the last 20 iterations.Graphical simulation outputs of the best individual solutions for particular case studies are depicted in Figures11, 13, and 15, whereas Figures 12, 14, and 16 show the simulation output of all 50 runs of ChaosDE, thus confirming the robustness of this approach. For the illustrative purposes, all graphical simulations outputs are depicted only for the variable x of the chaotic systems.Simulation of the best individual solution, ChaosDE and Burgers map: case study 1,CFSimple (a); case study 2, C
F
UNI (b).
(a)
(b)Simulation of all the 50 independent runs of EA, ChaosDE and Burgers map: case study 2, CFSimple (a); case study 1, C
F
UNI (b).
(a)
(b)Simulation of the best individual solution, ChaosDE and delayed logistic: case study 3, CFSimple (a); case study 4, C
F
UNI (b).
(a)
(b)Simulation of all the 50 independent runs of EA, ChaosDE and Delayed logistic: case study 3, CFSimple (a); case study 4, C
F
UNI (b).
(a)
(b)Simulation of the best individual solution, ChaosDE and Lozi map: case study 5, CFSimple (a); case study 6, C
F
UNI (b).
(a)
(b)Simulation of the all 50 independent runs of EA, ChaosDE and Lozi map: case study 5, CFSimple (a); case study 6, C
F
UNI (b).
(a)
(b)The values for desired p-1 UPOs (fixed points) of unperturbed chaotic systems based on the mathematical analysis of the systems are given in Table3.Table 3
The values for p-1 UPO.
Chaotic system
Values of p-1 UPO of unperturbed system
Burgers map
x
F = −0.7499
Delayed logistic map
x
F = 0.559471
Lozi map
x
F = 0.454545Table 4
Simple CF statistics: joined case studies 1 and 2, Burgers map as CPRNG/controlled system.
Statistical data
Case study 1CFsimple
Case study 2CFUNI
CF value
CF value
Min
2.16199
1.05 · 10−6
Max
2.16199
0.0103
Average
2.16199
6.67 · 10−4
Median
2.16199
5.32 · 10−7
Std. dev.
5.58 · 10−11
1.89 · 10−3
Average full stab. (iteration)
45
35Table 5
Characteristics of the best solution: joined case studies 1 and 2, Burgers map as CPRNG/controlled system.
Parameter
Case study 1CFsimple
Case study 2CFUNI
Value
Value
K
1.22847
0.732498
F
max
⁡
0.9
0.48495
R
0.574997
0.811742
CF value
2.16199
1.05 · 10−6
Istab. Value
45
25
Average error per iteration
5.86 · 10−5
1.21 · 10−8Table 6
Simple CF statistics: joined case studies 3 and 4, delayed logistic as CPRNG/controlled system.
Statistical data
Case study 3CFsimple
Case study 4CFUNI
CF value
CF value
Min
0.199798
2.3 · 10−15
Max
0.199798
2.7 · 10−15
Average
0.199798
2.44222 · 10−15
Median
0.199798
2.40551 · 10−15
Std. dev.
5.11 · 10−16
9.04629 · 10−17
Average full stab. (iteration)
10
7.5Table 7
Characteristics of the best solution: joined case studies 3 and 4, delayed logistic as CPRNG/controlled system.
Parameter
Case study 3CFsimple
Case study 4CFUNI
Value
Value
K
1.29837
1.31355
F
max
⁡
0.394579
0.336294
R
0.01
0.010219
CF value
0.199798
2.3 · 10−15
Istab. Value
10
8
Average error per iteration
2.22 · 10−17
0Table 8
Simple CF statistics: joined case studies 5 and 6, Lozi map as CPRNG/controlled system.
Statistical data
Case study 5CFsimple
Case study 6CFUNI
CF value
CF value
Min
0.520639
3.5331 · 10−15
Max
0.520639
4.0551 · 10−15
Average
0.520639
3.8063 · 10−15
Median
0.520639
3.6352 · 10−16
Std. dev.
2.41 · 10−15
1.19 · 10−16
Average full stab. (iteration)
32
11Table 9
Characteristics of the best solution: joined case studies 5 and 6, Lozi map as CPRNG/controlled system.
Parameter
Case study 5CFsimple
Case study 6CFUNI
Value
Value
K
−1.11259
−0.859989
F
max
⁡
0.9
0.643099
R
0.289232
0.065669
CF value
0.520639
3.5331 · 10−15
Istab. Value
21
9
Average error per iteration
7.21 · 10−15
0From the results presented in the Tables4–9, it follows that the CF-simple is very convenient for evolutionary process, which means that repeated runs of EA are giving identical optimal results (i.e., very close to the possible global extreme). This is graphically confirmed in Figures 12, 14, and 16, which show all 50 simulations. All the runs are basically merged into one line.On the other hand, the disadvantage of including of initial chaotic transient behavior of not stabilized system into the cost function value and subsequent resulting very tiny change of control method setting for extremely sensitive chaotic system is causing suppression of stabilization speed and numerical precision.Results obtained in the cases utilizing theC
F
UNI lend weight to the argument that the technique of pure searching for periodic orbits is advantageous for faster and more precise stabilization of chaotic system.


## 8. Conclusions

Based on obtained results, it may be claimed that the presented ChaosDE driven by selected discrete dissipative chaotic systems has given satisfactory results in the chaos control optimization issue.The results show that the embedding of the chaotic dynamics in the form of chaotic pseudorandom number generator into the differential evolution algorithm may help to improve the performance and robustness of the DE. ChaosDE is able to obtain optimal solutions securing the very fast and precise stabilization for both convenient CF surface, in case of the CF-simple, as well as for the very chaotic and nonlinear CF surface in case of the CF-universal.When comparing both the CF designs, the CF-simple is very convenient for evolutionary process (i.e., repeated runs are giving identical optimal results), but it has many limitations.The second universal CF design brings the possibility of using it problem free for any desired behavior of arbitrary chaotic systems but at the cost of the highly chaotic CF surface. Nevertheless, the embedding of the chaotic dynamics into the evolutionary algorithms helped to deal with such an issue.The primary aim of this work was not to develop any new pseudorandom number generator, which should normally pass many statistical tests but to show that through embedding the hidden chaotic dynamics into the evolutionary process in the form of chaotic pseudorandom number generators may help to obtain better results and avoid problems connected with evolutionary computation such as premature convergence and stagnation in local extremes.Future plans include testing of different chaotic systems, either manually or evolutionary tuning of parameters of chaotic maps, further complex comparisons with different heuristics and obtaining a large number of results to perform statistical tests.



---

*Source: 836484-2014-08-26.xml*