Global synchronization criteria for a class of third-order non-autonomous chaotic systems via linear state error feedback control

This paper investigates the global synchronization of a class of third-order non-autonomous chaotic systems via the master–slave linear state error feedback control. A sufficient global synchronization criterion of linear matrix inequality (LMI) and several algebraic synchronization criteria for single-variable coupling are proven. These LMI and algebraic synchronization criteria are then applied to two classes of well-known third-order chaotic systems, the generalized Lorenz systems and the gyrostat systems, proving that the local synchronization criteria for the chaotic generalized Lorenz systems developed in the existing literature can actually be extended to describe global synchronization and obtaining some easily implemented synchronization criteria for the gyrostat systems.     

Chaos optimization algorithms based on chaotic maps with different probability distribution and search speed for global optimization

Chaos optimization algorithms (COAs) usually utilize the chaotic map like Logistic map to generate the pseudo-random numbers mapped as the design variables for global optimization. Many existing researches indicated that COA can more easily escape from the local minima than classical stochastic optimization algorithms. This paper reveals the inherent mechanism of high efficiency and superior performance of COA, from a new perspective of both the probability distribution property and search speed of chaotic sequences generated by different chaotic maps. The statistical property and search speed of chaotic sequences are represented by the probability density function (PDF) and the Lyapunov exponent, respectively. Meanwhile, the computational performances of hybrid chaos-BFGS algorithms based on eight one-dimensional chaotic maps with different PDF and Lyapunov exponents are compared, in which BFGS is a quasi-Newton method for local optimization. Moreover, several multimodal benchmark examples illustrate that, the probability distribution property and search speed of chaotic sequences from different chaotic maps significantly affect the global searching capability and optimization efficiency of COA. To achieve the high efficiency of COA, it is recommended to adopt the appropriate chaotic map generating the desired chaotic sequences with uniform or nearly uniform probability distribution and large Lyapunov exponent.     

Chaotic bat algorithm

Bat algorithm (BA) is a recent metaheuristic optimization algorithm proposed by Yang. In the present study, we have introduced chaos into BA so as to increase its global search mobility for robust global optimization. Detailed studies have been carried out on benchmark problems with different chaotic maps. Here, four different variants of chaotic BA are introduced and thirteen different chaotic maps are utilized for validating each of these four variants. The results show that some variants of chaotic BAs can clearly outperform the standard BA for these benchmarks.     

Firefly algorithm with chaos

A recently developed metaheuristic optimization algorithm, firefly algorithm (FA), mimics the social behavior of fireflies based on the flashing and attraction characteristics of fireflies. In the present study, we will introduce chaos into FA so as to increase its global search mobility for robust global optimization. Detailed studies are carried out on benchmark problems with different chaotic maps. Here, 12 different chaotic maps are utilized to tune the attractive movement of the fireflies in the algorithm. The results show that some chaotic FAs can clearly outperform the standard FA.     

Continuous GRASP with a local active-set method for bound-constrained global optimization

Global optimization seeks a minimum or maximum of a multimodal function over a discrete or continuous domain. In this paper, we propose a hybrid heuristic—based on the CGRASP and GENCAN methods—for finding approximate solutions for continuous global optimization problems subject to box constraints. Experimental results illustrate the relative effectiveness of CGRASP–GENCAN on a set of benchmark multimodal test functions.     

The wavelet transform method applied to a coupled chaotic system with asymmetric coupling schemes

The wavelet transform method originated by Wei et al. (2002) [19] is an effective tool for enhancing the transverse stability of the synchronous manifold of a coupled chaotic system. Much of the theoretical study on this matter is centered on networks that are symmetrically coupled. However, in real applications, the coupling topology of a network is often asymmetric; see Belykh et al. (2006)  [23], [24], Chavez et al. (2005)  [25], Hwang et al. (2005)  [26], Juang et al. (2007)  [17], and Wu (2003)  [13]. In this work, a certain type of asymmetric sparse connection topology for networks of coupled chaotic systems is presented. Moreover, our work here represents the first step in understanding how to actually control the stability of global synchronization from dynamical chaos for asymmetrically connected networks of coupled chaotic systems via the wavelet transform method. In particular, we obtain the following results. First, it is shown that the lower bound for achieving synchrony of the coupled chaotic system with the wavelet transform method is independent of the number of nodes. Second, we demonstrate that the wavelet transform method as applied to networks of coupled chaotic systems is even more effective and controllable for asymmetric coupling schemes as compared to the symmetric cases.     

Chaotic catfish particle swarm optimization for solving global numerical optimization problems

Chaotic catfish particle swarm optimization (C-CatfishPSO) is a novel optimization algorithm proposed in this paper. C-CatfishPSO introduces chaotic maps into catfish particle swarm optimization (CatfishPSO), which increase the search capability of CatfishPSO via the chaos approach. Simple CatfishPSO relies on the incorporation of catfish particles into particle swarm optimization (PSO). The introduced catfish particles improve the performance of PSO considerably. Unlike other ordinary particles, the catfish particles initialize a new search from extreme points of the search space when the gbest fitness value (global optimum at each iteration) has not changed for a certain number of consecutive iterations. This results in further opportunities of finding better solutions for the swarm by guiding the entire swarm to promising new regions of the search space and accelerating the search. The introduced chaotic maps strengthen the solution quality of PSO and CatfishPSO significantly. The resulting improved PSO and CatfishPSO are called chaotic PSO (C-PSO) and chaotic CatfishPSO (C-CatfishPSO), respectively. PSO, C-PSO, CatfishPSO, C-CatfishPSO, as well as other advanced PSO procedures from the literature were extensively compared on several benchmark test functions. Statistical analysis of the experimental results indicate that the performance of C-CatfishPSO is better than the performance of PSO, C-PSO, CatfishPSO and that C-CatfishPSO is also superior to advanced PSO methods from the literature.     

Some simple global synchronization criterions for coupled time-varying chaotic systems

Based on the Lyapunov stabilization theory and matrix measure, this paper proposes some simple generic criterions of global chaos synchronization between two coupled time-varying chaotic systems from a unidirectional linear error feedback coupling approach. These simple criterions are applicable to some typical chaotic systems with different types of nonlinearity, such as the original Chua’s circuit and the Rössler chaotic system. The coupling parameters are determined according to the new criterion so as to ensure the coupled systems’ global chaos synchronization.     

Global synchronization criterion and adaptive synchronization for new chaotic system

This paper proposes two schemes of synchronization of two four-scorll chaotic attractor, a simple global synchronization and adaptive synchronization in the presence of unknown system parameters. Based on Lyapunov stability theory and matrix measure, a simple generic criterion is derived for global synchronization of four-scorll chaotic attractor system with a unidirectional linear error feedback coupling. This methods are applicable to a large class of chaotic systems where only a few algebraic inequalities are involved. Numerical simulations are presented to show the effectiveness of the proposed chaos synchronization method.     

Synchronization Criterion for Lur’e Systems via Delayed PD Controller

In this paper, the effects of a time varying delay on a chaotic drive-response synchronization are considered. Using a delayed feedback proportional-derivative (PD) controller scheme, a delay-dependent synchronization criterion is derived for chaotic systems represented by the Lur’e system with sector and slope restricted nonlinearities. The derived criterion is a sufficient condition for the absolute stability of the error dynamics between the drive and the response systems. By the use of a convex representation of the nonlinearity and the discretized Lyapunov-Krasovskii functional, stability condition is obtained via the LMI formulation. The condition represented in the terms of linear matrix inequalities (LMIs) can be solved by the application of convex optimization algorithms. The effectiveness of the work is verified through numerical examples.     

A hybrid method for quantum global optimization

This paper gives a quantum algorithm for global optimization. The heart of such approaches employ Grover’s database search (1996; Phys Rev Lett 79(23):4709–4712, 1997a; 79(2):325–328, 1997b). Chi and Kim (1998) show that when the phases of the generalized Grover database search operator are optimally chosen, it is capable of finding a solution by a single query. To apply this method to global optimization requires knowledge of the number of marked points m to calculate the optimal phases, but this value is seldom known. This paper focuses on overcoming this hurdle by showing that an estimate of the optimal phases can be found and used to replace the optimal phases while maintaining a high probability of finding a solution. Merging this finding with a recently discovered dynamic quantum global optimization algorithm (BBW2D) that reduces the problem to finding successively improving regions using Grover’s search, we present a hybrid method that improves the efficiency and reduces the variance of the search algorithm when empirically compared to other existing quantum search algorithms.     

Synchronization in complex networks with distinct chaotic nodes

We present an approach to the chaos synchronization of complex networks with distinct nodes. The chaotic synchronization is achieved by adding a derivative coupling term in the network equation. We assume that node in networks are different and are given by the Lorenz, Rössler, Chen and Sprott chaotic systems. The derivative term is capable to induce the synchronous behavior in the network. Moreover such a coupling leads the global behavior to a chaotic attractor. We found that without derivative coupling the network is leaded only to an equilibrium point or a limit cycle. Numerical simulations are provided to illustrate the result. Complementary the network synchrony can be chaotic in presence of the derivative coupling.     

Estimating the ultimate bound and positively invariant set for the Lorenz system and a unified chaotic system

To estimate the ultimate bound and positively invariant set for a dynamic system is an important but quite challenging task in general. In this paper, we attempt to investigate the ultimate bound and positively invariant set for two specific systems, the Lorenz system and a unified chaotic system. We derive an ellipsoidal estimate of the ultimate bound and positively invariant set for the Lorenz system, for all the positive values of its parameters a, b and c, and obtain the minimum value of volume for the ellipsoid. Comparing with the best results in the current literature [D. Li, J. Lu, X. Wu, G. Chen, Estimating the bounds for the Lorenz family of chaotic systems, Chaos Solitons Fractals 23 (2005) 529-534; X. Liao, On the global basin of attraction and positively invariant set for the Lorenz chaotic system and its application in chaos control and synchronization, Sci. China Ser. E 34 (2004) 1404-1419], our new results fill up the gap of the estimate for the cases of 0<a<1 and 0<b<2 [X. Liao, On the global basin of attraction and positively invariant set for the Lorenz chaotic system and its application in chaos control and synchronization, Sci. China Ser. E 34 (2004) 1404-1419]. Furthermore, the estimation derived here contains the results given in [D. Li, J. Lu, X. Wu, G. Chen, Estimating the bounds for the Lorenz family of chaotic systems, Chaos Solitons Fractals 23 (2005) 529-534] and [X. Liao, On the global basin of attraction and positively invariant set for the Lorenz chaotic system and its application in chaos control and synchronization, Sci. China Ser. E 34 (2004) 1404-1419] as special cases. Along the same line, we also provide estimates of cylindrical and ellipsoidal bounds for a unified chaotic system, for its parameter range , and obtain the minimum value of volume for the ellipsoid. The estimate is more accurate than and also extends the result of [D. Li, J. Lu, X. Wu, G. Chen, Estimating the bounds for the Lorenz family of chaotic systems, Chaos Solitons Fractals 23 (2005) 529-534] and [X. Liao, On the global basin of attraction and positively invariant set for the Lorenz chaotic system and its application in chaos control and synchronization, Sci. China Ser. E 34 (2004) 1404-1419].     

Conditions for Synchronization of One Oscillation System

Using methods of perturbation theory, we investigate the global behavior of trajectories on a toroidal attractor and in its neighborhood for a system of differential equations that arises in the study of synchronization of oscillations in the mathematical model of an optical laser. __________ Translated from Ukrains'kyi Matematychnyi Zhurnal, Vol. 57, No. 7, pp. 922–945, July, 2005.     

Linearly and nonlinearly bidirectionally coupled synchronization of hyperchaotic systems

To date, there have been many results about unidirectionally coupled synchronization of chaotic systems. However, much less work is reported on bidirectionally-coupled synchronization. In this paper, we investigate the synchronization of two bidirectionally coupled Chen hyperchaotic systems, which are coupled linearly and nonlinearly respectively. Firstly, linearly coupled synchronization of two hyperchaotic Chen systems is investigated, and a theorem on how to choose the coupling coefficients are developed to guarantee the global asymptotical synchronization of two coupled hyperchaotic systems. Analysis shows that the choice of the coupling coefficients relies on the bound of the chaotic system. Secondly, the nonlinearly coupled synchronization is studied; a sufficient condition for the locally asymptotical synchronization is derived, which is independent of the bound of the hyperchaotic system. Finally, numerical simulations are included to verify the effectiveness and feasibility of the developed theorems.     

Multivalued synchronization by Poincaré coupling

This work presents multivalued chaotic synchronization via coupling based on the Poincaré plane. The coupling is carried out by an underdamped signal, triggered every crossing event of the trajectory of the master system through a previously defined Poincaré plane. A master–slave system is explored, and the synchronization between the systems is detected via the auxiliary system approach and the maximum conditional Lyapunov exponent. Due to the response to specific conditions two phenomena may be obtained: univalued and multivalued synchronization. Since the Lyapunov exponent is not enough to detect these two phenomena, the distance between the pieces of trajectories of the slave and auxiliary systems with different initial conditions is also used as a tool for the detection of multivalued synchronization. Computer simulations using the benchmark chaotic systems of Lorenz and Rössler are used to exemplify the approach proposed.     

A chaos-based evolutionary algorithm for general nonlinear programming problems

In this paper we present a chaos-based evolutionary algorithm (EA) for solving nonlinear programming problems named chaotic genetic algorithm (CGA). CGA integrates genetic algorithm (GA) and chaotic local search (CLS) strategy to accelerate the optimum seeking operation and to speed the convergence to the global solution. The integration of global search represented in genetic algorithm and CLS procedures should offer the advantages of both optimization methods while offsetting their disadvantages. By this way, it is intended to enhance the global convergence and to prevent to stick on a local solution. The inherent characteristics of chaos can enhance optimization algorithms by enabling it to escape from local solutions and increase the convergence to reach to the global solution. Twelve chaotic maps have been analyzed in the proposed approach. The simulation results using the set of CEC’2005 show that the application of chaotic mapping may be an effective strategy to improve the performances of EAs.     

Synchronization in time-discrete model of two electrically coupled spike-bursting neurons

Dynamics of the ensemble of two model neurons interacting through electrical synapse is investigated. Both neurons are described by two-dimensional discontinuous map. It is shown that in four-dimensional phase space a chaotic attractor of relaxation type exists corresponding to spike-bursting chaotic oscillations. A new effect of recurrent transitory chaotic oscillations underlies a dynamical mechanism of chaotic bursts formation. It is shown that, under coupling, the transient from chaotic bursts generation into rest state occurs with a time delay. A new characteristic estimating the degree of spike-bursting synchronization is introduced. Dependence of the synchronism degree on the coupling strength is shown for some coupling interval where only activity synchronization occurs. A probabilistic study provides a dynamical explanation of these phenomena.     

An improved artificial bee colony algorithm for directing orbits of chaotic systems

Artificial bee colony algorithm (ABC) is a relatively new optimization technique which has been shown to be competitive to other population-based algorithms. However, there is still an insufficiency in ABC regarding its solution search equation, which is good at exploration but poor at exploitation. To address this concerning issue, we propose an improved ABC (IABC) by using a modified search strategy to generate a new food source in order that the exploration and exploitation can be well balanced and satisfactory optimization performances can be achieved. In addition, to enhance the global convergence, when producing the initial population, both opposition-based learning method and chaotic maps are employed. In this paper, the proposed algorithm is applied to control and synchronization of discrete chaotic systems which can be formulated as both multimodal numerical optimization problems with high dimension. Numerical simulation and comparisons with some typical existing algorithms demonstrate the effectiveness and robustness of the proposed approach.     

Chaotic invasive weed optimization algorithm with application to parameter estimation of chaotic systems

This paper introduces a novel hybrid optimization algorithm by taking advantage of the stochastic properties of chaotic search and the invasive weed optimization (IWO) method. In order to deal with the weaknesses associated with the conventional method, the proposed chaotic invasive weed optimization (CIWO) algorithm is presented which incorporates the capabilities of chaotic search methods. The functionality of the proposed optimization algorithm is investigated through several benchmark multi-dimensional functions. Furthermore, an identification technique for chaotic systems based on the CIWO algorithm is outlined and validated by several examples. The results established upon the proposed scheme are also supplemented which demonstrate superior performance with respect to other conventional methods.