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

UAV inspection path optimization in offshore wind farms using the OPTION-A*-DQN algorithm

Author

Listed:
  • Meiqing Xu
  • Chao Deng
  • Xiangyu Hu
  • Yuxin Lu
  • Wenyan Xue
  • Bin Zhu

Abstract

In response to the inefficiencies in offshore wind farm inspections caused by path redundancy and mission omissions, this study proposes a novel path planning method for Unmanned Aerial Vehicle (UAV) inspections, integrating multi-constraint optimization and intelligent scheduling. First, a four-dimensional constraint model is established, encompassing wind speed, charging, minimum UAV fleet size, and dynamic obstacle avoidance. Second, the OPTION-A*-DQN hybrid algorithm is developed by synergizing A* heuristic search with deep reinforcement learning (DRL) to balance global navigation and local optimization. An improved K-Means algorithm further enables efficient topological partitioning for multi-UAV collaboration. Comparative evaluations against original OPTION-DQN and conventional heuristic methods (Dijkstra and Simulated Annealing) demonstrate that the proposed method achieves three key improvements: (1) a 10% higher task completion rate, (2) a 14.9% reduction in path distance, and (3) a 20% faster simulation time. This work significantly advances intelligent path planning for offshore wind farm inspections.

Suggested Citation

  • Meiqing Xu & Chao Deng & Xiangyu Hu & Yuxin Lu & Wenyan Xue & Bin Zhu, 2025. "UAV inspection path optimization in offshore wind farms using the OPTION-A*-DQN algorithm," PLOS ONE, Public Library of Science, vol. 20(11), pages 1-22, November.
  • Handle: RePEc:plo:pone00:0336935
    DOI: 10.1371/journal.pone.0336935
    as

    Download full text from publisher

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

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

    File URL: https://libkey.io/10.1371/journal.pone.0336935?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:0336935. 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.