A Chaotic Krill Herd Optimization Algorithm for Global Numerical Estimation of the Attraction Domain for Nonlinear Systems

• Main Authors: Messaoud Aloui, Faiçal Hamidi, Houssem Jerbi, Mohamed Omri, Dumitru Popescu, Rabeh Abbassi
• Format: Article
• Language: English
• Published: MDPI AG 2021-07-01
• Series: Mathematics
• Subjects: nonlinear system; quadratic Lyapunov function; optimization; chaotic krill herd algorithm
• Online Access: https://www.mdpi.com/2227-7390/9/15/1743

Nowadays, solving constrained engineering problems related to optimization approaches is an attractive research topic. The chaotic krill herd approach is considered as one of most advanced optimization techniques. An advanced hybrid technique is exploited in this paper to solve the challenging problem of estimating the largest domain of attraction for nonlinear systems. Indeed, an intelligent methodology for the estimation of the largest stable equilibrium domain of attraction established on quadratic Lyapunov functions is developed. The designed technique aims at computing and characterizing a largest level set of a Lyapunov function that is included in a particular region, satisfying some hard and delicate algebraic constraints. The formulated optimization problem searches to solve a tangency constraint between the LF derivative sign and constraints on the level sets. Such formulation avoids possible dummy solutions for the nonlinear optimization solver. The analytical development of the solution exploits the Chebyshev chaotic map function that ensures high search space capabilities. The accuracy and efficiency of the chaotic krill herd technique has been evaluated by benchmark models of nonlinear systems. The optimization solution shows that the chaotic krill herd approach is effective in determining the largest estimate of the attraction domain. Moreover, since global optimality is needed for proper estimation, a bound type meta-heuristic optimization solver is implemented. In contrast to existing strategies, the synthesized technique can be exploited for both rational and polynomial Lyapunov functions. Moreover, it permits the exploitation of a chaotic operative optimization algorithm which guarantees converging to an expanded domain of attraction in an essentially restricted running time. The synthesized methodology is discussed, with several examples to illustrate the advantageous aspects of the designed approach.