A Dynamic Multiple-Query RRT Planning Algorithm for Manipulator Obstacle Avoidance

13Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

Manipulator motion planning for real-time obstacle avoidance in a dynamic environment is explored in this article. To address obstacle avoidance problems, a multiple-query and sampling-based motion replanning algorithm with the dynamic bias-goal factor, rapidly exploring random tree (DBG-RRT), is proposed to achieve a rapid response and a high success rate. Differently from other studies on path planning, a relay-node method is adopted on the basis of motion planning to generate a new collision-free trajectory. Subsequently, an un-interrupt strategy is embraced to judge whether the generated trajectory would be interfered with by dynamic obstacles. In the end, the DBG-RRT algorithm is applied, and the results demonstrate its effectiveness for manipulator motion planning in a dynamic environment.

Cite

CITATION STYLE

APA

Yuan, C., Shuai, C., & Zhang, W. (2023). A Dynamic Multiple-Query RRT Planning Algorithm for Manipulator Obstacle Avoidance. Applied Sciences (Switzerland), 13(6). https://doi.org/10.3390/app13063394

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free