The Science and Information (SAI) Organization
  • Home
  • About Us
  • Journals
  • Conferences
  • Contact Us

Publication Links

  • IJACSA
  • Author Guidelines
  • Publication Policies
  • Digital Archiving Policy
  • Promote your Publication
  • Metadata Harvesting (OAI2)

IJACSA

  • About the Journal
  • Call for Papers
  • Editorial Board
  • Author Guidelines
  • Submit your Paper
  • Current Issue
  • Archives
  • Indexing
  • Fees/ APC
  • Reviewers
  • Apply as a Reviewer

IJARAI

  • About the Journal
  • Archives
  • Indexing & Archiving

Special Issues

  • Home
  • Archives
  • Proposals
  • Guest Editors
  • SUSAI-EE 2025
  • ICONS-BA 2025
  • IoT-BLOCK 2025

Future of Information and Communication Conference (FICC)

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact

Computing Conference

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact

Intelligent Systems Conference (IntelliSys)

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact

Future Technologies Conference (FTC)

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact
  • Home
  • Call for Papers
  • Editorial Board
  • Guidelines
  • Submit
  • Current Issue
  • Archives
  • Indexing
  • Fees
  • Reviewers
  • Subscribe

DOI: 10.14569/IJACSA.2025.0160341
PDF

Multi-Strategy Improved Rapid Random Expansion Tree (RRT) Algorithm for Robotic Arm Path Planning

Author 1: Yuan Sun
Author 2: Shoujun Zhang

International Journal of Advanced Computer Science and Applications(IJACSA), Volume 16 Issue 3, 2025.

  • Abstract and Keywords
  • How to Cite this Article
  • {} BibTeX Source

Abstract: The purpose of this paper is to propose an improved RRT algorithm that incorporates multiple improvement strategies to solve the problems of low efficiency, long and unsmooth paths in the traditional rapid random expansion tree (RRT) algorithm for path planning of robotic arms. The algorithm first uses a bidirectional tree extension strategy to generate trees from both the starting point and the target position simultaneously, improving search efficiency and reducing redundant paths. Secondly, the algorithm introduces target bias sampling in combination with local Gaussian sampling, which renders the sampling points more focused on the target area, and dynamically adjusts the distribution to improve sampling efficiency and path connection speed. Concurrently, the algorithm is equipped with an adaptive step size strategy, which dynamically adjusts the expansion step size according to the target distance, thereby achieving a balance between rapid expansion over long distances and precise search at close range. Finally, a collision-free operation is ensured by a path verification mechanism, and the path is smoothed using cubic B-splines and minimum curvature optimisation techniques, significantly improving the smoothness of the path and the feasibility of the robot arm movement. As demonstrated by simulation experiments, the improved RRT algorithm exhibits a reduction in the average path length by 18.15%, planning time by 96.29%, the number of nodes by 92.13%, and the number of iterations by 91.60%, in comparison with the conventional RRT algorithm, when operating in complex map mode. These findings substantiate the efficacy and practicality of the improved RRT algorithm in the domain of robotic arm path planning.

Keywords: Robotic arm; RRT algorithm; path planning; target-biased sampling; Gaussian sampling; bidirectional tree extension; adaptive step-size

Yuan Sun and Shoujun Zhang, “Multi-Strategy Improved Rapid Random Expansion Tree (RRT) Algorithm for Robotic Arm Path Planning” International Journal of Advanced Computer Science and Applications(IJACSA), 16(3), 2025. http://dx.doi.org/10.14569/IJACSA.2025.0160341

@article{Sun2025,
title = {Multi-Strategy Improved Rapid Random Expansion Tree (RRT) Algorithm for Robotic Arm Path Planning},
journal = {International Journal of Advanced Computer Science and Applications},
doi = {10.14569/IJACSA.2025.0160341},
url = {http://dx.doi.org/10.14569/IJACSA.2025.0160341},
year = {2025},
publisher = {The Science and Information Organization},
volume = {16},
number = {3},
author = {Yuan Sun and Shoujun Zhang}
}



Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.

IJACSA

Upcoming Conferences

IntelliSys 2025

28-29 August 2025

  • Amsterdam, The Netherlands

Future Technologies Conference 2025

6-7 November 2025

  • Munich, Germany

Healthcare Conference 2026

21-22 May 2026

  • Amsterdam, The Netherlands

Computing Conference 2026

9-10 July 2026

  • London, United Kingdom

IntelliSys 2026

3-4 September 2026

  • Amsterdam, The Netherlands

Computer Vision Conference 2026

15-16 October 2026

  • Berlin, Germany
The Science and Information (SAI) Organization
BACK TO TOP

Computer Science Journal

  • About the Journal
  • Call for Papers
  • Submit Paper
  • Indexing

Our Conferences

  • Computing Conference
  • Intelligent Systems Conference
  • Future Technologies Conference
  • Communication Conference

Help & Support

  • Contact Us
  • About Us
  • Terms and Conditions
  • Privacy Policy

© The Science and Information (SAI) Organization Limited. All rights reserved. Registered in England and Wales. Company Number 8933205. thesai.org