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

Obstacle Avoidance Path Planning of a 4-DOF Weapon Arm Based on Improved RRT (RRT-H) Algorithm

Author

Listed:
  • Kaifan Zou
  • Xiaorong Guan
  • Zhong Li
  • Huibin Li
  • Changlong Jiang
  • Zihui Zhu
  • Rohit Salgotra

Abstract

To improve soldiers’ combat capability, weapon arms have a good development prospect. However, due to special work scenarios and tasks, new requirements are exerted on. Based on the fast-expanding random tree algorithm (RRT), path algorithm optimization (RRT-H) is proposed for the path planning of weapon arms. Overall path optimization is achieved by reducing the local path length with a closer path point planning to the obstacle. In a complex environment, the RRT-H algorithm can avoid local traps by guiding the new path extension direction and exploring multiple different paths in the map. The superiority of this algorithm is verified with 2D plane obstacle avoidance and pathfinding simulation experiments. Compared to RRT∗, RRT∗ smart, and information RRT∗, the RRT-H can obtain high-quality calculation results in a shorter time. After setting degrees of freedom (DOF) as that of variables, the algorithm is applied to the 4-DOF weapon arm, which confirms an effective reduction to the 4-DOF weapon arm’s motion costs.

Suggested Citation

  • Kaifan Zou & Xiaorong Guan & Zhong Li & Huibin Li & Changlong Jiang & Zihui Zhu & Rohit Salgotra, 2024. "Obstacle Avoidance Path Planning of a 4-DOF Weapon Arm Based on Improved RRT (RRT-H) Algorithm," Mathematical Problems in Engineering, Hindawi, vol. 2024, pages 1-11, February.
  • Handle: RePEc:hin:jnlmpe:3866834
    DOI: 10.1155/2024/3866834
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/mpe/2024/3866834.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/mpe/2024/3866834.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2024/3866834?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:3866834. 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.