IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0304971.html
   My bibliography  Save this article

A Wild Horse Optimization algorithm with chaotic inertia weights and its application in linear antenna array synthesis

Author

Listed:
  • WanRu Zhao
  • Yan Liu
  • JianHui Li
  • TianNing Zhu
  • KunXia Zhao
  • Kui Hu

Abstract

Antennas play a crucial role in designing an efficient communication system. However, reducing the maximum sidelobe level (SLL) of the beam pattern is a crucial challenge in antenna arrays. Pattern synthesis in smart antennas is a major area of research because of its widespread application across various radar and communication systems. This paper presents an effective technique to minimize the SLL and thus improve the radiation pattern of the linear antenna array (LAA) using the chaotic inertia-weighted Wild Horse optimization (IERWHO) algorithm. The wild horse optimizer (WHO) is a new metaheuristic algorithm based on the social behavior of wild horses. The IERWHO algorithm is an improved Wild Horse optimization (WHO) algorithm that combines the concepts of chaotic sequence factor, nonlinear factor, and inertia weights factor. In this paper, the method is applied for the first time in antenna array synthesis by optimizing parameters such as inter-element spacing and excitation to minimize the SLL while keeping other constraints within the boundary limits, while ensuring that the performance is not affected. For performance evaluation, the simulation tests include 12 benchmark test functions and 12 test functions to verify the effectiveness of the improvement strategies. According to the encouraging research results in this paper, the IERWHO algorithm proposed has a place in the field of optimization.

Suggested Citation

  • WanRu Zhao & Yan Liu & JianHui Li & TianNing Zhu & KunXia Zhao & Kui Hu, 2024. "A Wild Horse Optimization algorithm with chaotic inertia weights and its application in linear antenna array synthesis," PLOS ONE, Public Library of Science, vol. 19(7), pages 1-25, July.
  • Handle: RePEc:plo:pone00:0304971
    DOI: 10.1371/journal.pone.0304971
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0304971
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0304971&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0304971?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:plo:pone00:0304971. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.