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

Research on path planning algorithms for Crawler transport robots in complex tunnels

Author

Listed:
  • TongZhu Yu
  • JiuHong Wang
  • DaiXiang Zhang
  • YaoMeng Xiao
  • CanGuang Zheng
  • Dan Kang
  • Yang Jiang
  • MingChao Du
  • Kun Zhang
  • Xin Tong

Abstract

To meet the demand for efficient and safe underground material transportation in the intelligent construction of coal mines, addressing the unstructured environmental characteristics of mine roadways, this study proposes an improved path planning algorithm based on the A* algorithm. It aims to achieve the dual requirements of driving efficiency and operational safety for robots in complex environments. The algorithm adopts a collaborative architecture combining global and local path planning: at the global level, it enhances search efficiency by introducing a bidirectional adaptive search strategy and incorporates terrain risk weights into the cost function, enabling the planned path to effectively avoid high-risk areas and achieve global path optimization; at the local level, it integrates the DWA algorithm to strengthen the robot’s real-time obstacle avoidance capability and ensure operational safety. To validate the algorithm’s effectiveness, path planning experiments were conducted in a simulated environment. The results demonstrate that the proposed algorithm effectively avoids various obstacles, significantly shortens path length and search time, providing a viable solution for path planning and navigation of tracked transport robots in complex roadways.

Suggested Citation

  • TongZhu Yu & JiuHong Wang & DaiXiang Zhang & YaoMeng Xiao & CanGuang Zheng & Dan Kang & Yang Jiang & MingChao Du & Kun Zhang & Xin Tong, 2026. "Research on path planning algorithms for Crawler transport robots in complex tunnels," PLOS ONE, Public Library of Science, vol. 21(5), pages 1-15, May.
  • Handle: RePEc:plo:pone00:0342122
    DOI: 10.1371/journal.pone.0342122
    as

    Download full text from publisher

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

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

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