IDEAS home Printed from https://ideas.repec.org/a/wsi/ijmpcx/v36y2025i09ns0129183125500056.html
   My bibliography  Save this article

Multi-objective unmanned vehicle path planning based on whale optimization algorithm

Author

Listed:
  • Xinlu Zong

    (School of Computer Science, Hubei University of Technology, Wuhan 430068, P. R. China)

  • Xue Xia

    (School of Computer Science, Hubei University of Technology, Wuhan 430068, P. R. China)

  • Zexi Chen

    (��Xiaomi Technology (Wuhan) Co., Ltd, Wuhan 430068, P. R. China)

Abstract

Path planning is an important part of the research field of mobile robots. How to plan more suitable paths more quickly has become a challenging optimization problem that requires consideration of several constraints and performance metrics. Given the multitude of optimization objectives and the intricate nature of addressing the static path planning problem, it is usually converted into a single-objective optimization problem. However, this approach would lead to the algorithm being unable to thoroughly explore the solution space. To address this problem, a nondominated sorting whale optimization algorithm based on crowding degree and memory (NSWOACDM) is presented and applied to unmanned vehicle path planning in this paper. Both the length and curvature of path are optimized simultaneously. Experimental results on benchmark functions show that the proposed algorithm is more effective compared with other traditional multi-objective algorithms. The effects of different control points on the optimization results are analyzed through path planning experiments. The experimental results demonstrate that the NSWOACDM algorithm exhibits superior performance in comparison to similar algorithms. Furthermore, it is capable of identifying several viable paths within a reduced timeframe in the context of the multi-objective path planning issue.

Suggested Citation

  • Xinlu Zong & Xue Xia & Zexi Chen, 2025. "Multi-objective unmanned vehicle path planning based on whale optimization algorithm," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 36(09), pages 1-24, September.
  • Handle: RePEc:wsi:ijmpcx:v:36:y:2025:i:09:n:s0129183125500056
    DOI: 10.1142/S0129183125500056
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183125500056
    Download Restriction: Access to full text is restricted to subscribers

    File URL: https://libkey.io/10.1142/S0129183125500056?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:wsi:ijmpcx:v:36:y:2025:i:09:n:s0129183125500056. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .

    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.