The Algorithm of Multiple Obstacle Avoidance Tasks for Dual-Arm Robots

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

This article is free to access.

Abstract

To achieve multiple obstacle avoidance tasks consisting of zero-space obstacle avoidance and terminal obstacle avoidance with self-avoidance permission, we propose an algorithm for multiple obstacle avoidance tasks for dual-arm robots. First, we design a self-obstacle avoidance gradient optimization function to implement the self-obstacle avoidance task between the two arms of dual-arm robots by using the pseudo-distance as the basis for the collision judgment. Second, the terminal obstacle avoidance task for dual-arm robots is implemented by applying an adaptive terminal obstacle avoidance velocity. Third, a zero-space obstacle avoidance task for dual-arm robots is realized using an adaptive virtual repulsion force. Finally, a dual-arm robot consisting of two 6-DOF Jaco2 manipulators is simulated in a Matlab environment to verify the obstacle avoidance algorithm of dual-arm robots. The simulation results show that the algorithm proposed in this paper can complete the multi-obstacle avoidance tasks of terminal obstacle avoidance and zero-space obstacle avoidance simultaneously with the premise of realizing the self-obstacle avoidance of dual-arm robots, and has a minor terminal trajectory error, which proves that the algorithm is in the feasibility of completing terminal obstacle avoidance and zero-space obstacle avoidance with the premise of realizing dual-arm robots self-obstacle avoidance.

Cite

CITATION STYLE

APA

Pu, Q., Xu, X., Zhang, H., Li, Q., Rodic, A., Petrovich, P. B., … Wang, Z. (2023). The Algorithm of Multiple Obstacle Avoidance Tasks for Dual-Arm Robots. IEEE Access, 11, 79190–79202. https://doi.org/10.1109/ACCESS.2023.3288331

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