IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i15p1743-d600191.html
   My bibliography  Save this article

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

Author

Listed:
  • Messaoud Aloui

    (Laboratory “Modélisation, Analyse et Commande des Systèmes”, University of Gabes, Gabes LR16ES22, Tunisia)

  • Faiçal Hamidi

    (Laboratory “Modélisation, Analyse et Commande des Systèmes”, University of Gabes, Gabes LR16ES22, Tunisia)

  • Houssem Jerbi

    (Department of Industrial Engineering, College of Engineering, University of Hail, Hail 1234, Saudi Arabia)

  • Mohamed Omri

    (Deanship of Scientific Research (DSR), King Abdulaziz University, Jeddah 21589, Saudi Arabia)

  • Dumitru Popescu

    (Faculty of Automatics and Computers, University Politehnica of Bucharest, RO-060042 Bucharest, Romania)

  • Rabeh Abbassi

    (Department of Electrical Engineering, College of Engineering, University of Hail, Hail 1234, Saudi Arabia)

Abstract

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.

Suggested Citation

  • Messaoud Aloui & Faiçal Hamidi & Houssem Jerbi & Mohamed Omri & Dumitru Popescu & Rabeh Abbassi, 2021. "A Chaotic Krill Herd Optimization Algorithm for Global Numerical Estimation of the Attraction Domain for Nonlinear Systems," Mathematics, MDPI, vol. 9(15), pages 1-30, July.
  • Handle: RePEc:gam:jmathe:v:9:y:2021:i:15:p:1743-:d:600191
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/15/1743/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/9/15/1743/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Chuen Kit Luk & Graziano Chesi, 2015. "On the estimation of the domain of attraction for discrete-time switched and hybrid nonlinear systems," International Journal of Systems Science, Taylor & Francis Journals, vol. 46(15), pages 2781-2787, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:9:y:2021:i:15:p:1743-:d:600191. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.