TY - GEN
T1 - An Extension of the MB-RRT Method to Solve the Inverse Kinematics Problem for Real Robot Manipulators
AU - Santos, David O.
AU - Freire, Raimundo C.S.
AU - Carvalho, Elyson A.N.
AU - Santos, Matheus C.
AU - Molina, Lucas
AU - Carvalho, Jose G.N.
AU - Freire, Eduardo O.
N1 - Publisher Copyright:
© 2025 IEEE.
PY - 2025
Y1 - 2025
N2 - In previous work, a solution to the inverse kinematics (IK) problem of manipulator robots, called the Manipulator-Based Rapidly-exploring Random Tree (MB-RRT), was proposed. Unlike the classical RRT, it grows the tree as a spatial representation of the manipulator in the workspace rather than in the configuration space, reducing the search space to three dimensions. The technique also introduces a new probability model for sampling new nodes and a novel metric for finding the nearest nodes. The two main advantages of the method over other IK solvers are its ability to handle obstructed environments easily and the invariance of its search space with respect to the number of joints in the robot. However, the original method is not suitable for robots with one-dimensional joints operating in three-dimensional space, which is common in real scenarios. This paper proposes an extension of the method to address these scenarios. The extension retains its effectiveness in handling obstructed environments and the invariance of its search space to the number of joints. Furthermore, the proposed solution obtained high success rates in the IK problem of two robots, 6-Dof and 7-Dof, in both obstructed maps and a obstacle-free map.
AB - In previous work, a solution to the inverse kinematics (IK) problem of manipulator robots, called the Manipulator-Based Rapidly-exploring Random Tree (MB-RRT), was proposed. Unlike the classical RRT, it grows the tree as a spatial representation of the manipulator in the workspace rather than in the configuration space, reducing the search space to three dimensions. The technique also introduces a new probability model for sampling new nodes and a novel metric for finding the nearest nodes. The two main advantages of the method over other IK solvers are its ability to handle obstructed environments easily and the invariance of its search space with respect to the number of joints in the robot. However, the original method is not suitable for robots with one-dimensional joints operating in three-dimensional space, which is common in real scenarios. This paper proposes an extension of the method to address these scenarios. The extension retains its effectiveness in handling obstructed environments and the invariance of its search space to the number of joints. Furthermore, the proposed solution obtained high success rates in the IK problem of two robots, 6-Dof and 7-Dof, in both obstructed maps and a obstacle-free map.
KW - inverse kinematics
KW - manipulators
KW - MB-RRT
KW - Rapidly-exploring Random Tree
UR - https://www.scopus.com/pages/publications/105012129560
U2 - 10.1109/CROS66186.2025.11066089
DO - 10.1109/CROS66186.2025.11066089
M3 - Conference contribution
AN - SCOPUS:105012129560
T3 - Proceedings - 2025 1st Conference on Robotics, CROS 2025
BT - Proceedings - 2025 1st Conference on Robotics, CROS 2025
A2 - Macharet, Douglas Guimaraes
A2 - Goncalves, Luiz Marcos Garcia
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 1st Conference on Robotics, CROS 2025
Y2 - 28 April 2025 through 30 April 2025
ER -