2004
DOI: 10.1016/j.physleta.2004.02.026
|View full text |Cite
|
Sign up to set email alerts
|

Directing orbits of chaotic systems using a hybrid optimization strategy

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2006
2006
2019
2019

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 19 publications
(6 citation statements)
references
References 4 publications
0
6
0
Order By: Relevance
“…Directing orbits of chaotic systems is a multi-modal numerical optimization problem [8] [9]. Consider the following discrete chaotic dynamical system:…”
Section: Application To Direct Orbits Of Chaotic Systemsmentioning
confidence: 99%
“…Directing orbits of chaotic systems is a multi-modal numerical optimization problem [8] [9]. Consider the following discrete chaotic dynamical system:…”
Section: Application To Direct Orbits Of Chaotic Systemsmentioning
confidence: 99%
“…It was regarded that chaos synchronization also can be formulated as the above problem [15,16]. Similarly, assume that feedback only acts on the first component, i.e., K 11 (k) 5 0 and all other components of K(k) are zeros.…”
Section: Problem Formulationmentioning
confidence: 99%
“…Table 3 lists the SR and AVEN under different combination of N, l and e. From Table 3, firstly it can be concluded that PSO can direct the chaotic orbit to target region with high probability. Secondly, by comparing the results using genetic algorithm [15] and simplex-annealing strategy [16], less evaluation number is needed for PSO so that PSO is more efficient. However, as e decreases (better directing precision degree is required) it can be seen that SR decreases and AVEN increases respectively when the combination of N and l is fixed.…”
Section: Simulation On Directing Chaotic Orbitsmentioning
confidence: 99%
See 1 more Smart Citation
“…From the viewpoint of optimization, control of chaotic systems could be formulated as multi-modal constrained numerical optimization problems [47][48][49]. Genetic algorithm [50], simplex-annealing strategy [51], Particle swarm optimization [52], and Differential Evolution [53] have been considered. Wang et al [51] proposed an effective hybrid optimization strategy by combining the probabilistic jump search of simulated annealing with the convex polyhedron-based geometry search of Nelder-Mead Simplex method.…”
Section: Introductionmentioning
confidence: 99%