Parameters identification of chaotic system by chaotic gravitational search algorithm

97Citations
Citations of this article
46Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, for the parameter identification problem of chaotic system, a chaotic gravitational search algorithm (CGSA) is proposed. At first, an iterative chaotic map with infinite collapses is introduced and chaotic local search (CLS) is designed, then CLS and basic gravitational search are combined in the procedure frame. The CGSA is composed of coarse gravitational search and fine chaotic local search, while chaotic search seeks the optimal solution further, based on the current best solution found by the coarse gravitational search. In order to show the effectiveness of CGSA, both offline and online parameter identifications of Lorenz system are conducted in comparative experiments, while the performances of CGSA are compared with GA, PSO and GSA. The results demonstrate the effectiveness and efficiency of CGSA in solving the problem of parameter identification of chaotic system, and the improvement to GSA has been verified. © 2012 Elsevier Ltd. All rights reserved.

Cite

CITATION STYLE

APA

Li, C., Zhou, J., Xiao, J., & Xiao, H. (2012). Parameters identification of chaotic system by chaotic gravitational search algorithm. Chaos, Solitons and Fractals, 45(4), 539–547. https://doi.org/10.1016/j.chaos.2012.02.005

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free