IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/2902170.html
   My bibliography  Save this article

Global Path Planning for Unmanned Surface Vehicle Based on Improved Quantum Ant Colony Algorithm

Author

Listed:
  • Guoqing Xia
  • Zhiwei Han
  • Bo Zhao
  • Caiyun Liu
  • Xinwei Wang

Abstract

As a tool to monitor marine environments and to perform dangerous tasks instead of manned vessels, unmanned surface vehicles (USVs) have extensive applications. Because most path planning algorithms have difficulty meeting the mission requirements of USVs, the purpose of this study was to plan a global path with multiple objectives, such as path length, energy consumption, path smoothness, and path safety, for USV in marine environments. A global path planning algorithm based on an improved quantum ant colony algorithm (IQACA) is proposed. The improved quantum ant colony algorithm is an algorithm that benefits from the high efficiency of quantum computing and the optimization ability of the ant colony algorithm. The proposed algorithm can plan a path considering multiple objectives simultaneously. The simulation results show that the proposed algorithm’s obtained minimum was 2.1–6.5% lower than those of the quantum ant colony algorithm (QACA) and ant colony algorithm (ACA), and the number of iterations required to converge to the minimum was 11.2–24.5% lower than those of the QACA and ACA. In addition, the optimized path for the USV was obtained effectively and efficiently.

Suggested Citation

  • Guoqing Xia & Zhiwei Han & Bo Zhao & Caiyun Liu & Xinwei Wang, 2019. "Global Path Planning for Unmanned Surface Vehicle Based on Improved Quantum Ant Colony Algorithm," Mathematical Problems in Engineering, Hindawi, vol. 2019, pages 1-10, April.
    • Handle: RePEc:hin:jnlmpe:2902170
    DOI: 10.1155/2019/2902170
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2019/2902170.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2019/2902170.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2019/2902170?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:hin:jnlmpe:2902170. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.