Abstract

Parameter estimation is a fundamental research issue which has attracted great concern in the control and synchronization of chaotic systems. This problem can be mathematically described as a multi-dimensional continuous optimization problem through constructing an appropriate fitness function, and then solved via meta-heuristic algorithms. A hybrid flower pollination algorithm is proposed in this paper for solving this problem more efficiently. The proposed algorithm well combines the good global exploration ability of the original flower pollination algorithm and the powerful local exploitation ability of the Nelder–Mead simplex method together by integrating these two methods in a very simple way. The experimental results tested on three typical chaotic system parameter estimation problems with three unknown system parameters, including the Lorenz system, the Rossler system, and the Lorenz system under the noise condition, demonstrate that the algorithm can estimate the unknown parameters efficiently and accurately. The comparisons with the basic flower pollination algorithm and some other four reported methods including the quantum particle swarm optimization, the hybrid adaptive cuckoo search optimization algorithm, the oppositional backtracking search optimization algorithm, and the hybrid algorithm combining differential evolution with artificial bee colony suggest that the proposed algorithm is energy efficient and superior. The proposed algorithm can be used as a new and effective choice for parameter estimation of chaotic systems.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.