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

Research on path planning of robotic arms based on DAPF-RRT algorithm

Author

Listed:
  • Zhenggang Wang
  • Junyang Tang
  • Fangxu Yi
  • Xiangrui Ren
  • Kunxiang Wang

Abstract

In response to the widely used RRT-Connect path planning algorithm in the field of robotic arms, which has problems such as long search time, random node growth, multiple and unsmooth path turns, a path planning algorithm combining dynamic step size and artificial potential field is proposed. To solve the problem of scattered sampling points in the RRT-Connect algorithm, a goal-biased strategy is introduced. To address the problem of slow expansion caused by using fixed step sizes, a dynamic step size strategy is introduced to dynamically adjust the step size. To reduce randomness in the expansion process, the artificial potential field method is integrated to constrain the growth of new nodes by the random sampling function, the target gravitational function and the repulsion function. Finally, the planned path is pruned and smoothed using cubic B-splines to improve redundant points and turns in the path, and reduce the occurrence of shaking during the motion of the robotic arm. In the same environment, the improved algorithm reduces path length by 15.4% and planning time by 49.2%, compared with the RRT-Connect algorithm.

Suggested Citation

  • Zhenggang Wang & Junyang Tang & Fangxu Yi & Xiangrui Ren & Kunxiang Wang, 2025. "Research on path planning of robotic arms based on DAPF-RRT algorithm," PLOS ONE, Public Library of Science, vol. 20(5), pages 1-20, May.
  • Handle: RePEc:plo:pone00:0323734
    DOI: 10.1371/journal.pone.0323734
    as

    Download full text from publisher

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

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

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