Using chaos in genetic algorithms

Determan, John C.; Foster, James A.

doi:10.1109/cec.1999.785533

Cited by 29 publications

(9 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Determan and Foster incorporated a simple chaotic system—the logistic equation—into a standard GA. The results confirmed that a thoughtful use of chaos in simulated evolution is advantageous [75]. GAs and chaos are techniques that are motivated by nature.…”

Section: Chaos Synthesis In Roboticssupporting

confidence: 65%

Applications of Chaotic Dynamics in Robotics

Zang

Iqbal

Zhu

et al. 2016

International Journal of Advanced Robotic Systems

View full text Add to dashboard Cite

This article presents a summary of applications of chaos and fractals in robotics. Firstly, basic concepts of deterministic chaos and fractals are discussed. Then, fundamental tools of chaos theory used for identifying and quantifying chaotic dynamics will be shared. Principal applications of chaos and fractal structures in robotics research, such as chaotic mobile robots, chaotic behaviour exhibited by mobile robots interacting with the environment, chaotic optimization algorithms, chaotic dynamics in bipedal locomotion and fractal mechanisms in modular robots will be presented. A brief survey is reported and an analysis of the reviewed publications is also presented.

show abstract

Section: Chaos Synthesis In Roboticssupporting

confidence: 65%

Applications of Chaotic Dynamics in Robotics

Zang

Iqbal

Zhu

et al. 2016

International Journal of Advanced Robotic Systems

View full text Add to dashboard Cite

show abstract

“…However, in this paper the original Parrondo's games will be used for analyzing the differences be t w een chaotic, random and periodic switching strategies. The motivation for exploring chaotic strategies is inspired by the fact that they have been shown to be superior for a number of different types of optimization problems [10][11][12][13][14]. The seminal papers that considered chaotic switching in Parrondo's games were by Arena et al [15] and Bucolo et al [10].…”

Section: Parrondo's Gamesmentioning

confidence: 99%

Investigation of Chaotic Switching Strategies in Parrondo's Games

2004

View full text Add to dashboard Cite

An analysis of Parrondo's games with different chaotic switching strategies is carried out. We generalize a fair way to compare between different switching strategies. The performance of Parrondo's games with chaotic switching strategies is compared to random and periodic switching strategies. The rate of winning of Parrondo's games with chaotic switching strategies depends on coefficient(s) defining the chaotic generator, initial conditions of the chaotic sequence and the proportion of Game A played. Maximum rate of winning can be obtained with all the above mentioned factors properly set, and this occurs when chaotic switching strategy approaches periodic-like behavior.

show abstract

“…Determan and Foster [19] proposed and evaluated a new type of mutation operator for GA (λ-mutation) based on logistic map. They have used Prisoners Dilemma and genetic clustering as test problems and showed that the introduction of deterministic chaos affected the exploration/exploitation ratio of the algorithm.…”

Section: B Deterministic Chaos In Ga De and Psomentioning

confidence: 99%

On the Use of Chaos in Nature-Inspired Optimization Methods

Krömer

Snáel

Zelinka

2013

2013 IEEE International Conference on Systems, Man, and Cybernetics

View full text Add to dashboard Cite

Stochastic nature-inspired optimization and search methods depend on streams of integer and floating point numbers generated in course of their execution. The pseudo-random numbers are utilized for in-silico emulation of probability-driven natural processes such as modification of genetic information (mutation, crossover), partner selection, and survival of the fittest (selection, migration) and environmental effects (small random changes in motion direction and velocity). Deterministic chaos is a well known mathematical concept that can be used to generate sequences of seemingly random real numbers within selected interval in a predictable and controllable way. In the past, it has been used as a basis for various pseudo-random number generators with interesting properties. This work provides an empirical comparison of the performance of genetic algorithms, differential evolution, and particle swarm optimization using different pseudo-random number generators and chaotic systems as sources of stochasticity.

show abstract

Using chaos in genetic algorithms

Cited by 29 publications

References 10 publications

Applications of Chaotic Dynamics in Robotics

Applications of Chaotic Dynamics in Robotics

Investigation of Chaotic Switching Strategies in Parrondo's Games

On the Use of Chaos in Nature-Inspired Optimization Methods

Contact Info

Product

Resources

About