IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v231y2025icp144-159.html
   My bibliography  Save this article

Multi-strategy ensemble wind driven optimization algorithm for robot path planning

Author

Listed:
  • Zhang, Chao
  • Yang, Yi
  • Chen, Wei

Abstract

In this study, a multi-strategy ensemble wind driven optimization (MEWDO) algorithm is proposed and combined with cubic spline interpolation to solve path planning challenges for single and multiple robots. The proposed MEWDO uses a Chebyshev map to initialize air particle populations and increase population diversity. A segmented learning local exploitation strategy is proposed to upgrade the exploitation ability of the algorithm. To enhance the exploration ability of the algorithm, a mutation strategy is introduced that disturbs dimensions one by one, based on the F-distribution with asymmetric characteristics. First, performance comparison experiments were conducted between MEWDO and seven other intelligent algorithms on 16 benchmark test functions. The results showed that MEWDO performed the best. Second, path planning simulation experiments were conducted in three static environments to compare MEWDO with three intelligent algorithms and the artificial potential field method, and MEWDO outperformed the comparison algorithms in terms of the planned shortest path and algorithm stability. In some complex rescue environments, multiple robots are frequently sent to perform tasks from different routes to improve the rescue success rate. For this purpose, MEWDO was used to plan task paths for five robots to test its performance in multi-robot path planning. The results showed that MEWDO finds the best route for all five robots to perform the task in a complex environment.

Suggested Citation

  • Zhang, Chao & Yang, Yi & Chen, Wei, 2025. "Multi-strategy ensemble wind driven optimization algorithm for robot path planning," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 231(C), pages 144-159.
  • Handle: RePEc:eee:matcom:v:231:y:2025:i:c:p:144-159
    DOI: 10.1016/j.matcom.2024.11.023
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475424004798
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.matcom.2024.11.023?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:eee:matcom:v:231:y:2025:i:c:p:144-159. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.