IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0349943.html

A path planning approach for ship collision avoidance integrating BRB reasoning and velocity obstacle algorithm

Author

Listed:
  • Minmin Zheng
  • Shuwu Wang
  • Haiyang Tu
  • Qianyu Lu

Abstract

Reliable path planning for ship collision avoidance remains challenging in complex maritime environments with dense traffic. This study proposes a novel approach that integrates Belief-Rule-Based (BRB) reasoning with the Velocity Obstacle (VO) algorithm for multi-ship encounter scenarios. First, the BRB framework groups ships with similar movement trends and close proximity, reducing both the number of avoidance targets and decision-making complexity. Based on the grouping results, the safety domain radius for individual ships and ship groups is set proportionally to ship length. Subsequently, the VO algorithm generates safe and feasible avoidance trajectories toward the goal. The method was tested in two scenarios, showing improved navigational safety and operational efficiency in congested waters. This work provides a foundation for intelligent decision-making in maritime safety management and supports sustainable development in the shipping industry.

Suggested Citation

  • Minmin Zheng & Shuwu Wang & Haiyang Tu & Qianyu Lu, 2026. "A path planning approach for ship collision avoidance integrating BRB reasoning and velocity obstacle algorithm," PLOS ONE, Public Library of Science, vol. 21(6), pages 1-20, June.
    • Handle: RePEc:plo:pone00:0349943
    DOI: 10.1371/journal.pone.0349943
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0349943
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0349943&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0349943?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:0349943. 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.